Typical sequences revisited -- computing width parameters of graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 1303600 (Why is no real title available?)
- scientific article; zbMATH DE number 6862107 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A c^k n 5-approximation algorithm for treewidth
- Approximation algorithms for treewidth
- Complete Register Allocation Problems
- Constructive linear time algorithms for branchwidth
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Derivation of algorithms for cutwidth and related graph layout parameters
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Faster computation of path-width
- Graph minors. XIII: The disjoint paths problem
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Parameterized and Exact Computation
- Scheduling expression DAGs for minimal register need
- The Generation of Optimal Code for Arithmetic Expressions
- The Recognition of Series Parallel Digraphs
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
Cited in
(2)
This page was built for publication: Typical sequences revisited -- computing width parameters of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701067)
