Pages that link to "Item:Q1262131"
From MaRDI portal
The following pages link to Counting clique trees and computing perfect elimination schemes in parallel (Q1262131):
Displaying 38 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Clique trees of infinite locally finite chordal graphs (Q1753106) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
- Multigraph representations of hierarchical loglinear models (Q1918460) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- An efficient representation of chordal graphs (Q2450661) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- (Q5000291) (← links)
- Notes on the Distributed Computation of Merge Trees on CW-Complexes (Q5359524) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling (Q6119506) (← links)
- A new characterization of \(k\)-trees and some applications (Q6552676) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)