Imbalance is fixed parameter tractable
From MaRDI portal
Publication:2445234
DOI10.1016/j.ipl.2013.06.010zbMath1284.68471OpenAlexW2088523445MaRDI QIDQ2445234
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Publication date: 14 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.010
imbalancegraph algorithmsparametrized complexityfixed-parameter tractable algorithmgraph layout problems
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Brushing with additional cleaning restrictions ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Imbalance parameterized by twin cover revisited ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Algorithmic Applications of Tree-Cut Width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clean the graph before you draw it!
- Interval graphs and searching
- The vertex separation number of a graph equals its path-width
- Algorithms for area-efficient orthogonal drawing
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Balanced vertex-orderings of graphs
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
- Drawing planar graphs using the canonical ordering
- Parametrized complexity theory.
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Computing and Combinatorics
This page was built for publication: Imbalance is fixed parameter tractable
