Pages that link to "Item:Q1199941"
From MaRDI portal
The following pages link to On a graph partition problem with application to VLSI layout (Q1199941):
Displayed 9 items.
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- Minimal rankings and the arank number of a path (Q2501577) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)