Algorithms for weakly triangulated graphs
From MaRDI portal
Recommendations
Cites work
- An efficient algorithm for finding a two-pair, and its applications
- Covering orthogonal polygons with star polygons: The perfect graph approach
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- Finding large holes
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Perfect Graphs and Orthogonally Convex Covers
- Weakly triangulated graphs
Cited in
(43)- Finding large holes
- Finding a maximum induced matching in weakly chordal graphs
- Optimizing weakly triangulated graphs
- Approximation of knapsack problems with conflict and forcing graphs
- Recognizing graph search trees
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- The complexity of dissociation set problems in graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- The k-separator problem: polyhedra, complexity and approximation results
- Classes of perfect graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- NP-completeness results for edge modification problems
- Maximal sub-triangulation in pre-processing phylogenetic data
- Independent packings in structured graphs
- Recognizing weakly triangulated graphs by edge separability
- scientific article; zbMATH DE number 1617254 (Why is no real title available?)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- Symmetric graph-theoretic roles of two-pairs and chords of cycles
- Improved algorithms for weakly chordal graphs
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Gender-aware facility location in multi-gender world
- Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Weakly Triangulated Comparability Graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Generating weakly triangulated graphs
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- The recognition problem of graph search trees
- Edge erasures and chordal graphs
- A fast new algorithm for weak graph regularity
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- scientific article; zbMATH DE number 969165 (Why is no real title available?)
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- A separator-based method for generating weakly chordal graphs
- Generating weakly chordal graphs from arbitrary graphs
- Graph Search Trees and Their Leaves
- Reconfiguring planar perfect matchings via bounded length alternating cycles
- On the leaves of graph search trees
- Verification of a certificate for weakly chordal graphs
- Algorithms and complexity for path covers of temporal DAGs
- Linearity defect of edge ideals and Fröberg's theorem
- Maximum weight independent sets in hole- and co-chair-free graphs
- A vertex incremental approach for maintaining chordality
This page was built for publication: Algorithms for weakly triangulated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891926)
