An FPT algorithm for bipartite vertex splitting

DOI10.1007/978-3-031-22203-0_19arXiv2208.12898OpenAlexW4317393696MaRDI QIDQ6172201

Reyan Ahmed, Myroslav Kryven, Stephen G. Kobourov

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

fixed parameter tractabilitygraph drawingvertex splitting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Splitting plane graphs to outerplanarity

Cites Work

• Unnamed Item
• Three ways to cover a graph
• Fixed parameter algorithms for one-sided crossing minimization revisited
• On the planar split thickness of graphs
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• Planarizing Graphs - A Survey and Annotated Bibliography
• A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
• Ranking and Drawing in Subexponential Time
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Graph Drawing
• SPLITTING NUMBER is NP-complete
• On the complexity of \(k\)-SAT
• Planarizing graphs and their drawings by vertex splitting

This page was built for publication: An FPT algorithm for bipartite vertex splitting