FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2013215731> ?p ?o ?g. }

• W2013215731 endingPage "77" @default.
• W2013215731 startingPage "43" @default.
• W2013215731 abstract "The use of (generalized) tree structure in graphs is one of the main topics in the field of efficient graph algorithms. The well-known partial k-tree (resp. treewidth) approach belongs to this kind of research and bases on a tree structure of constant-size bounded maximal cliques. Without size bound on the cliques this tree structure of maximal cliques characterizes chordal graphs which are known to be important also in connection with relational database schemes where hypergraphs with tree structure (acyclic hypergraphs) and their elimination orderings (perfect elimination orderings for chordal graphs, Graham-reduction for acyclic hypergraphs) are studied. We consider here graphs with a tree structure which is dual (in the sense of hypergraphs) to that one of chordal graphs (therefore we call these graphs dually chordal). The corresponding vertex elimination orderings of these graphs are the maximum neighbourhood orderings. These orderings were studied recently in several papers and some of the algorithmic consequences of such orderings are given. The aim of this paper is a systematic treatment of the algorithmic use of maximum neighhourhood orderings. These orderings are useful especially for dominating-like problems (including Steiner tree) and distance problems. Many problems efficiently solvable for strongly chordal and doubly chordal graphs remain efficiently solvable for dually chordal graphs too. Our results on dually chordal graphs not only generalize, but also improve and extend the corresponding results on strongly chordal and doubly chordal graphs, since a maximum neighbourhood ordering (if it exists) can be constructed in linear time and we consequently use the underlying structure properties of dually chordal graphs closely connected to hypergraphs. Furthermore, a collection of problems remaining NP-complete on dually chordal graphs is given." @default.
• W2013215731 created "2016-06-24" @default.
• W2013215731 creator A5033947410 @default.
• W2013215731 creator A5085372854 @default.
• W2013215731 creator A5086851146 @default.
• W2013215731 date "1998-03-01" @default.
• W2013215731 modified "2023-10-01" @default.
• W2013215731 title "The algorithmic use of hypertree structure and maximum neighbourhood orderings" @default.
• W2013215731 cites W1968148694 @default.
• W2013215731 cites W1983784871 @default.
• W2013215731 cites W1987698099 @default.
• W2013215731 cites W1991477862 @default.
• W2013215731 cites W1996641400 @default.
• W2013215731 cites W1997998268 @default.
• W2013215731 cites W2012550027 @default.
• W2013215731 cites W2012579657 @default.
• W2013215731 cites W2015067965 @default.
• W2013215731 cites W2025275119 @default.
• W2013215731 cites W2026564263 @default.
• W2013215731 cites W2039686598 @default.
• W2013215731 cites W2050038504 @default.
• W2013215731 cites W2050228489 @default.
• W2013215731 cites W2056974750 @default.
• W2013215731 cites W2063906290 @default.
• W2013215731 cites W2068361557 @default.
• W2013215731 cites W2072141822 @default.
• W2013215731 cites W2080076699 @default.
• W2013215731 cites W2084535093 @default.
• W2013215731 cites W2086119402 @default.
• W2013215731 cites W2097374444 @default.
• W2013215731 cites W2141178123 @default.
• W2013215731 cites W2153250924 @default.
• W2013215731 cites W4239852074 @default.
• W2013215731 doi "https://doi.org/10.1016/s0166-218x(97)00125-x" @default.
• W2013215731 hasPublicationYear "1998" @default.
• W2013215731 type Work @default.
• W2013215731 sameAs 2013215731 @default.
• W2013215731 citedByCount "72" @default.
• W2013215731 countsByYear W20132157312012 @default.
• W2013215731 countsByYear W20132157312014 @default.
• W2013215731 countsByYear W20132157312015 @default.
• W2013215731 countsByYear W20132157312016 @default.
• W2013215731 countsByYear W20132157312017 @default.
• W2013215731 countsByYear W20132157312018 @default.
• W2013215731 countsByYear W20132157312019 @default.
• W2013215731 countsByYear W20132157312020 @default.
• W2013215731 countsByYear W20132157312021 @default.
• W2013215731 countsByYear W20132157312022 @default.
• W2013215731 countsByYear W20132157312023 @default.
• W2013215731 crossrefType "journal-article" @default.
• W2013215731 hasAuthorship W2013215731A5033947410 @default.
• W2013215731 hasAuthorship W2013215731A5085372854 @default.
• W2013215731 hasAuthorship W2013215731A5086851146 @default.
• W2013215731 hasConcept C102192266 @default.
• W2013215731 hasConcept C113174947 @default.
• W2013215731 hasConcept C114614502 @default.
• W2013215731 hasConcept C118615104 @default.
• W2013215731 hasConcept C132525143 @default.
• W2013215731 hasConcept C132569581 @default.
• W2013215731 hasConcept C134306372 @default.
• W2013215731 hasConcept C160446614 @default.
• W2013215731 hasConcept C161677786 @default.
• W2013215731 hasConcept C192939610 @default.
• W2013215731 hasConcept C202444582 @default.
• W2013215731 hasConcept C203776342 @default.
• W2013215731 hasConcept C206352148 @default.
• W2013215731 hasConcept C33923547 @default.
• W2013215731 hasConcept C43517604 @default.
• W2013215731 hasConcept C67810366 @default.
• W2013215731 hasConcept C74133993 @default.
• W2013215731 hasConcept C97654310 @default.
• W2013215731 hasConceptScore W2013215731C102192266 @default.
• W2013215731 hasConceptScore W2013215731C113174947 @default.
• W2013215731 hasConceptScore W2013215731C114614502 @default.
• W2013215731 hasConceptScore W2013215731C118615104 @default.
• W2013215731 hasConceptScore W2013215731C132525143 @default.
• W2013215731 hasConceptScore W2013215731C132569581 @default.
• W2013215731 hasConceptScore W2013215731C134306372 @default.
• W2013215731 hasConceptScore W2013215731C160446614 @default.
• W2013215731 hasConceptScore W2013215731C161677786 @default.
• W2013215731 hasConceptScore W2013215731C192939610 @default.
• W2013215731 hasConceptScore W2013215731C202444582 @default.
• W2013215731 hasConceptScore W2013215731C203776342 @default.
• W2013215731 hasConceptScore W2013215731C206352148 @default.
• W2013215731 hasConceptScore W2013215731C33923547 @default.
• W2013215731 hasConceptScore W2013215731C43517604 @default.
• W2013215731 hasConceptScore W2013215731C67810366 @default.
• W2013215731 hasConceptScore W2013215731C74133993 @default.
• W2013215731 hasConceptScore W2013215731C97654310 @default.
• W2013215731 hasIssue "1-3" @default.
• W2013215731 hasLocation W20132157311 @default.
• W2013215731 hasOpenAccess W2013215731 @default.
• W2013215731 hasPrimaryLocation W20132157311 @default.
• W2013215731 hasRelatedWork W1986676437 @default.
• W2013215731 hasRelatedWork W2013215731 @default.
• W2013215731 hasRelatedWork W2046755592 @default.
• W2013215731 hasRelatedWork W2073285758 @default.
• W2013215731 hasRelatedWork W2125939925 @default.

• next