Bundled Crossings in Embedded Graphs

DOI10.1007/978-3-662-49529-2_34MaRDI QIDQ2802960zbMATH OpenOpenAlexFDO

Authors Martin Fink, Kevin Verbeek, John Hershberger, Subhash Suri

Publication date 3 May 2016

Published in LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_34

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• Algorithms for graphs embeddable with few crossings per edge
• Fundamentals of Computation Theory
• Bounded complete embedding graphs
• Embedded connectivity of complete-transposition graphs
• Embedding Graphs Simultaneously with Fixed Edges
• Approximating the bundled crossing number
• Approximating the Bundled Crossing Number
• Crossing graphs of fiber-complemented graphs
• Crossing graphs of fiber-complemented graphs

Cited in

(16)

• Edges and switches, tunnels and bridges
• Approximating the bundled crossing number
• Parameterized analysis and crossing minimization problems
• Bundled crossings revisited
• The Bundled Crossing Number
• Edges and Switches, Tunnels and Bridges
• Crossing Layout in Non-planar Graph Drawings
• On strict (outer-)confluent graphs
• The degenerate crossing number and higher-genus embeddings
• Bundled crossings revisited
• Crossing minimization in perturbed drawings
• Crossing minimization in perturbed drawings
• Approximating the Bundled Crossing Number
• Block crossings in one-sided tanglegrams
• Block crossings in one-sided tanglegrams
• Storylines with a protagonist

This page was built for publication: Bundled Crossings in Embedded Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802960)