Algorithms for the fixed linear crossing number problem

DOI10.1016/S0166-218X(01)00314-6zbMath1002.68194MaRDI QIDQ1613416

Robert J. Cimikowski

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

fixed linear crossing number problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Mixed linear layouts: complexity, heuristics, and experiments ⋮ Planar crossing numbers of graphs of bounded genus ⋮ Approximating the fixed linear crossing number ⋮ An analysis of some linear graph layout heuristics ⋮ Crossing Minimisation Heuristics for 2-page Drawings

Cites Work

• A new variation on hypercubes with smaller diameter
• On crossing numbers of hypercubes and cube connected cycles
• A framework for solving VLSI graph layout problems
• ``Neural computation of decisions in optimization problems
• The book thickness of a graph
• Algorithms for drawing graphs: An annotated bibliography
• Embedding de Bruijn, Kautz and shuffle-exchange networks in books
• An experimental comparison of four graph drawing algorithms.
• Circulants and their connectivities
• Single Row Routing
• The bandwidth problem for graphs and matrices—a survey
• Graphs with E Edges Have Pagenumber O(√E)
• On VLSI layouts of the star graph and related networks
• 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
• Crossing minimization in linear embeddings of graphs
• The toroidal crossing number of the complete graph
• A Boundary Method for Planar Travelling Salesman Problems
• Sorting Using Networks of Queues and Stacks
• Bounds for the crossing number of the N‐cube
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for the fixed linear crossing number problem