Inserting multiple edges into a planar graph

DOI10.4230/LIPICS.SOCG.2016.30MaRDI QIDQ3132864zbMATH OpenFDO

Authors Markus Chimani, Petr Hliněný

Publication date 30 January 2018

Full work available at URL https://arxiv.org/abs/1509.07952

zbMATH Keywords

crossing numberedge insertionfunnel algorithmparameterized complexitypath homotopy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Inserting an edge into a planar graph
• Inserting an edge into a planar graph
• Inserting an edge into a geometric embedding

Cited in

(16)

• Crossing numbers and stress of random graphs
• Crossing number for graphs with bounded pathwidth
• 1-planarity testing and embedding: an experimental study
• Parameterized analysis and crossing minimization problems
• A note on the practicality of maximal planar subgraph algorithms
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)
• scientific article; zbMATH DE number 7278018 (Why is no real title available?)
• Inserting an edge into a geometric embedding
• Inserting an edge into a geometric embedding
• Inserting one edge into a simple drawing is hard
• Extension of some edge graph problems: standard, parameterized and approximation complexity
• scientific article; zbMATH DE number 7765366 (Why is no real title available?)
• Inserting Multiple Edges into a Planar Graph
• Planarizing graphs and their drawings by vertex splitting
• Crossing-optimal extension of simple drawings
• Exact algorithms for clustered planarity with linear saturators

This page was built for publication: Inserting multiple edges into a planar graph

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