An analysis of some linear graph layout heuristics

DOI10.1007/s10732-006-4294-9zbMath1163.90809OpenAlexW2009746746MaRDI QIDQ2491338

Robert J. Cimikowski

Publication date: 29 May 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-006-4294-9

zbMATH Keywords

Approximation algorithmHeuristicCrossing numberLinear graph layout

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Upward Book Embeddings of st-Graphs

Cites Work

• A framework for solving VLSI graph layout problems
• The book thickness of a graph
• Algorithms for drawing graphs: An annotated bibliography
• Algorithms for the fixed linear crossing number problem
• Single Row Routing
• The bandwidth problem for graphs and matrices—a survey
• Graphs with E Edges Have Pagenumber O(√E)
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The book crossing number of a graph
• Sorting Using Networks of Queues and Stacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analysis of some linear graph layout heuristics