Space-efficient vertex separators for treewidth
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A \(c^k n\) 5-approximation algorithm for treewidth
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximation algorithms for treewidth
- Depth-First Search Using $$O(n)$$ Bits
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XIII: The disjoint paths problem
- Improved approximation algorithms for minimum-weight vertex separators
- In-place initializable arrays
- Membership in Constant Time and Almost-Minimum Space
- Network flows. Theory, algorithms, and applications.
- On-the-fly array initialization in less space
- Parameterized algorithms
- Quantitative analysis of smart contracts
- Rank-select indices without tears
- Selection and sorting with limited storage
- Simple 2^f-Color Choice Dictionaries
- Space efficient linear time algorithms for BFS, DFS and applications
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Space-efficient Euler partition and bipartite edge coloring
- Space-efficient basic graph algorithms
- Space-efficient biconnected components and recognition of outerplanar graphs
- Streaming kernelization
- Succinct representation of labeled graphs
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
Cited in
(5)
This page was built for publication: Space-efficient vertex separators for treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165026)
