I/O-efficient algorithms for graphs of bounded treewidth
From MaRDI portal
Publication:834592
DOI10.1007/S00453-007-9131-5zbMATH Open1213.05249OpenAlexW3139402347MaRDI QIDQ834592FDOQ834592
Authors: Anil Maheshwari, Norbert Zeh 
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9131-5
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Theorem on Boolean Matrices
- The buffer tree: A technique for designing batched external data structures
- Easy problems for tree-decomposable graphs
- Title not available (Why is that?)
- On rigid circuit graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Three Partition Refinement Algorithms
- Treewidth. Computations and approximations
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Efficient external memory algorithms by simulating coarse-grained parallel algorithms
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic theory of graph reduction
- Efficient Parallel Algorithms for Chordal Graphs
- I/O-Optimal Algorithms for Outerplanar Graphs
- Title not available (Why is that?)
- I/O-efficient undirected shortest paths
- Algorithms for parallel memory, I: Two-level memories
- Title not available (Why is that?)
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms finding tree-decompositions of graphs
- A functional approach to external graph algorithms
- On external-memory MST, SSSP and multi-way planar graph separation
- Title not available (Why is that?)
- On External-Memory Planar Depth First Search
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
Cited In (4)
Uses Software
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)
