I/O-efficient algorithms for graphs of bounded treewidth
From MaRDI portal
Recommendations
- I/O-efficient algorithms for graphs of bounded treewidth
- Dynamic algorithms for graphs of bounded treewidth
- Dynamic algorithms for graphs of bounded treewidth
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Compact I/O-efficient representation of separable graphs and optimal tree layouts
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- I/O-efficient algorithms on near-planar graphs
- I/O-Efficient Algorithms on Near-Planar Graphs
- scientific article; zbMATH DE number 1323192
Cites work
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 1305462 (Why is no real title available?)
- scientific article; zbMATH DE number 1107730 (Why is no real title available?)
- scientific article; zbMATH DE number 1947435 (Why is no real title available?)
- scientific article; zbMATH DE number 1984682 (Why is no real title available?)
- scientific article; zbMATH DE number 2119685 (Why is no real title available?)
- scientific article; zbMATH DE number 910869 (Why is no real title available?)
- scientific article; zbMATH DE number 1445387 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Theorem on Boolean Matrices
- A functional approach to external graph algorithms
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms finding tree-decompositions of graphs
- Algorithms for parallel memory, I: Two-level memories
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- An algebraic theory of graph reduction
- Easy problems for tree-decomposable graphs
- Efficient Parallel Algorithms for Chordal Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Efficient external memory algorithms by simulating coarse-grained parallel algorithms
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
- I/O-Optimal Algorithms for Outerplanar Graphs
- I/O-efficient undirected shortest paths
- Introduction to algorithms
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On External-Memory Planar Depth First Search
- On external-memory MST, SSSP and multi-way planar graph separation
- On rigid circuit graphs
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The buffer tree: A technique for designing batched external data structures
- Three Partition Refinement Algorithms
- Treewidth. Computations and approximations
Cited in
(6)- scientific article; zbMATH DE number 7310159 (Why is no real title available?)
- I/O-efficient algorithms for graphs of bounded treewidth
- Space-efficient vertex separators for treewidth
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- scientific article; zbMATH DE number 6783432 (Why is no real title available?)
This page was built for publication: I/O-efficient algorithms for graphs of bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834592)
