Pages that link to "Item:Q1347072"
From MaRDI portal
The following pages link to Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072):
Displayed 11 items.
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)