Rankings of graphs

DOI10.1007/3-540-59071-4_56zbMath1528.68274OpenAlexW1479059960MaRDI QIDQ6184378

Hans L. Bodlaender, Dieter Kratsch, Ton Kloks, Jitender S. Deogun, Haiko Müller, Klaus Jansen, Zsolt Tuza

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59071-4_56

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On an edge ranking problem of trees and graphs
• Graph minors. V. Excluding a planar graph
• Optimal node ranking of trees
• On a graph partition problem with application to VLSI layout
• Optimal node ranking of tree in linear time
• Graph minors. XIII: The disjoint paths problem
• Graph minors. IV: Tree-width and well-quasi-ordering
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Comparability Graph of a Tree
• A linear time algorithm for finding tree-decompositions of small treewidth
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item