Book embeddings and crossing numbers
From MaRDI portal
Publication:6184374
DOI10.1007/3-540-59071-4_53zbMath1528.68321OpenAlexW1505429336WikidataQ56689207 ScholiaQ56689207MaRDI QIDQ6184374
Farhad Shahrokhi, László A. Székely, Imrich Vrt'o, Ondrej Sýkora
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_53
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On crossing numbers of hypercubes and cube connected cycles
- On \(k\)-planar crossing numbers
- The book thickness of a graph
- Applications of the crossing number
- A near optimal algorithm for edge separators (preliminary version)
- Pagenumber of complete bipartite graphs
- The bandwidth problem for graphs and matrices—a survey
- Crossing-Free Subgraphs
- New results on rectilinear crossing numbers and plane embeddings
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Graph layout problems
- Crossing minimization in linear embeddings of graphs
- The toroidal crossing number of the complete graph
- Crossing Number Problems
- On a problem of P. Turan concerning graphs
This page was built for publication: Book embeddings and crossing numbers