Pages that link to "Item:Q792351"
From MaRDI portal
The following pages link to Some aspects of perfect elimination orderings in chordal graphs (Q792351):
Displaying 21 items.
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Peakless functions on graphs (Q678883) (← links)
- A Helly theorem for convexity in graphs (Q799698) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution (Q1311330) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Antimatroids and balanced pairs (Q2454046) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Matrices with chordal inverse zero-patterns (Q4274547) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Coloring problem of signed interval graphs (Q4997206) (← links)