scientific article; zbMATH DE number 1414315

zbMath0941.05516MaRDI QIDQ4942652

Haiko Müller, Dieter Kratsch, Jitender S. Deogun, Ton Kloks

Publication date: 16 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (29)

Vertex ranking of asteroidal triple-free graphs ⋮ On Dasgupta's hierarchical clustering objective and its relation to other graph parameters ⋮ Finding minimum height elimination trees for interval graphs in polynomial time ⋮ Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Edge ranking of graphs is hard ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Forbidden graphs for tree-depth ⋮ On low tree-depth decompositions ⋮ Grad and classes with bounded expansion. I: Decompositions ⋮ Grad and classes with bounded expansion. II: Algorithmic aspects ⋮ Rankings of graphs ⋮ On the tree-depth of random graphs ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs ⋮ Arankings of trees ⋮ Optimal vertex ranking of block graphs ⋮ Tree-depth, subgraph coloring and homomorphism bounds ⋮ Rank numbers of grid graphs ⋮ LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth ⋮ On low rank-width colorings ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ An optimal parallel algorithm for node ranking of cographs ⋮ Biconvex graphs: Ordering and algorithms ⋮ Algorithms for generalized vertex-rankings of partial k-trees ⋮ Unnamed Item ⋮ Obstructions for Tree-depth ⋮ Counting Homomorphisms to Sparse Graphs ⋮ On vertex rankings of graphs and its relatives ⋮ On vertex ranking of a starlike graph ⋮ On Treewidth and Related Parameters of Random Geometric Graphs

This page was built for publication: