A fixed-parameter approach to two-layer planarization

DOI10.1007/3-540-45848-4_1MaRDI QIDQ3043700zbMATH OpenFDO

Authors Vida Dujmović, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, N. Nishimura, Frances Rosamond, Matthew Suderman, David R. Wood, Prabhakar Ragde, Sue Whitesides

Publication date 6 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650001.htm

Mathematics Subject Classification ID

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

Recommendations

• A fixed-parameter approach to 2-layer planarization
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• Two-layer planarization: Improving on parameterized algorithmics
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• Graph Drawing

Cited in

(19)

• Parameterized algorithmics for linear arrangement problems
• Drawing graphs in two layers
• Linear-time recognition of bipartite graphs plus two edges
• A new neural network algorithm for planarization problems
• Planar graph bipartization in linear time
• A fixed-parameter approach to 2-layer planarization
• scientific article; zbMATH DE number 3845604 (Why is no real title available?)
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• Two-layer planarization parameterized by feedback edge set
• Graph Bipartization and via minimization
• Two-layer planarization parameterized by feedback edge set
• Two-layer planarization in graph drawing
• On the planarization of wireless sensor networks
• Two-layer planarization: Improving on parameterized algorithmics
• Graph Drawing
• Planar bus graphs
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• On the parameterized complexity of layered graph drawing

This page was built for publication: A fixed-parameter approach to two-layer planarization

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