Two-Layer Planarization: Improving on Parameterized Algorithmics

DOI10.7155/jgaa.00106zbMath1108.68062OpenAlexW1964259962MaRDI QIDQ3378516

Henning Fernau

Publication date: 3 April 2006

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

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

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

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

Related Items

A top-down approach to search-trees: Improved algorithmics for 3-hitting set ⋮ Parameterized analysis and crossing minimization problems ⋮ Two-layer planarization parameterized by feedback edge set ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ On the parameterized complexity of layered graph drawing ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case ⋮ Comparing trees via crossing minimization ⋮ A bounded search tree algorithm for parameterized face cover ⋮ Parameterized algorithmics for linear arrangement problems