Pages that link to "Item:Q1662549"
From MaRDI portal
The following pages link to An introduction to clique minimal separator decomposition (Q1662549):
Displaying 23 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Decomposition by maxclique separators (Q465285) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Trees of tangles in abstract separation systems (Q2229193) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Characterizing atoms that result from decomposition by clique separators (Q2364081) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- On computing the Gromov hyperbolicity (Q2828207) (← links)
- A decomposition theorem for chordal graphs and its applications (Q2851517) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- The <i>G</i>-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models (Q5057256) (← links)