Two-Layer Planarization: Improving on Parameterized Algorithmics

DOI10.7155/JGAA.00106MaRDI QIDQ3378516zbMATH OpenOpenAlexFDO

Authors Henning Fernau

Publication date 3 April 2006

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/53070

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 2084262
• A fixed-parameter approach to 2-layer planarization
• Drawing graphs in two layers
• scientific article; zbMATH DE number 1303024

Cited in

(19)

• A bounded search tree algorithm for parameterized face cover
• Parameterized algorithmics for linear arrangement problems
• Parameterized analysis and crossing minimization problems
• A fixed-parameter approach to 2-layer planarization
• scientific article; zbMATH DE number 2084262 (Why is no real title available?)
• 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 parameterized by feedback edge set
• Two-layer planarization parameterized by feedback edge set
• scientific article; zbMATH DE number 1303024 (Why is no real title available?)
• SOFSEM 2005: Theory and Practice of Computer Science
• Graph Drawing
• A survey of parameterized algorithms and the complexity of edge modification
• Parameterized algorithms for planar 2-layer drawing by vertex splitting on a given subset
• Improved kernelization and fixed-parameter algorithm for bipartite one-sided vertex explosion
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• On the parameterized complexity of layered graph drawing
• Parameterized algorithms for d-hitting set: the weighted case
• Comparing trees via crossing minimization

This page was built for publication: Two-Layer Planarization: Improving on Parameterized Algorithmics

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