Cutwidth I: A linear time fixed parameter algorithm
From MaRDI portal
Recommendations
Cited in
(45)- Cutwidth: obstructions and algorithmic aspects
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- On spanning tree congestion of graphs
- Deleting edges to restrict the size of an epidemic in temporal networks
- Parameterized algorithms for minimum sum vertex cover
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Deleting edges to restrict the size of an epidemic in temporal networks
- The treewidth of line graphs
- A linear fixed parameter tractable algorithm for connected pathwidth
- Computing the chromatic number using graph decompositions via matrix rank
- Mathematical Foundations of Computer Science 2003
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Computing Tree Decompositions
- scientific article; zbMATH DE number 2080246 (Why is no real title available?)
- Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
- On width measures and topological problems on semi-complete digraphs
- Edge-treewidth: algorithmic and combinatorial properties
- Branch and bound for the cutwidth minimization problem
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- The structure of graphs not admitting a fixed immersion
- Confronting intractability via parameters
- Cutwidth: obstructions and algorithmic aspects
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- On cutwidth parameterized by vertex cover
- Derivation of algorithms for cutwidth and related graph layout parameters
- On minimizing width in linear layouts
- Invariants of graph drawings in the plane
- On cutwidth parameterized by vertex cover
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- The point-set embeddability problem for plane graphs
- Scheduling series-parallel task graphs to minimize peak memory
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Exact and parameterized algorithms for window width minimization in bipartite arrangement
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- Reachability in graph transformation systems and slice languages
- scientific article; zbMATH DE number 7471715 (Why is no real title available?)
- Computing the cutwidth of bipartite permutation graphs in linear time
- Cutwidth of split graphs and threshold graphs
- Typical sequences revisited -- computing width parameters of graphs
- New lower bounds on the cutwidth of graphs
- Fixed-parameter tractability of treewidth and pathwidth
- Parameterized algorithms for minimum sum vertex cover
This page was built for publication: Cutwidth I: A linear time fixed parameter algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462383)
