I/O-efficient algorithms for graphs of bounded treewidth
type: Item
instance of: scholarly article
title: I/O-efficient algorithms for graphs of bounded treewidth
zbMATH Open document ID: 1213.05249
author: Anil Maheshwari
author: Norbert Zeh
published in: Algorithmica
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5598785
zbMATH Keywords: algorithms
zbMATH Keywords: external memory algorithms
zbMATH Keywords: bounded treewidth
zbMATH Keywords: graph algorithms
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: s00453-007-9131-5
OpenAlex ID: W3139402347
cites work: A functional approach to external graph algorithms
cites work: The buffer tree: A technique for designing batched external data structures
cites work: On External-Memory Planar Depth First Search
cites work: Q4428993
cites work: On external-memory MST, SSSP and multi-way planar graph separation
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Easy problems for tree-decomposable graphs
cites work: An algebraic theory of graph reduction
cites work: Q3795218
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Parallel algorithms for series parallel graphs and graphs with treewidth two
cites work: Q4952710
cites work: Q4886043
cites work: Introduction to algorithms
cites work: Q4373678
cites work: Efficient external memory algorithms by simulating coarse-grained parallel algorithms
cites work: On rigid circuit graphs
cites work: Q5572939
cites work: Efficient Parallel Algorithms for Chordal Graphs
cites work: Treewidth. Computations and approximations
cites work: Q4828956
cites work: I/O-Optimal Algorithms for Outerplanar Graphs
cites work: Algorithms finding tree-decompositions of graphs
cites work: Q4411404
cites work: Algorithms - ESA 2003
cites work: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
cites work: Q4252349
cites work: Three Partition Refinement Algorithms
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Q3216652
cites work: Algorithms for parallel memory, I: Two-level memories
cites work: Algorithms for parallel memory. II: Hierarchical multilevel memories
cites work: A Theorem on Boolean Matrices
DOI: 10.1007/S00453-007-9131-5
Recommended article: I/O-efficient algorithms for graphs of bounded treewidth
Recommended article: Dynamic algorithms for graphs of bounded treewidth
Recommended article: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Recommended article: Compact I/O-efficient representation of separable graphs and optimal tree layouts
Recommended article: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Recommended article: Algorithms for graphs of bounded treewidth via orthogonal range searching
Recommended article: I/O-efficient algorithms on near-planar graphs
Recommended article: I/O-Efficient Algorithms on Near-Planar Graphs
Recommended article: Q4255109
description: scientific article; zbMATH DE number 5598785