B. van Antwerpen de Fluiter

Bio: B. van Antwerpen de Fluiter is an academic researcher from Altera. The author has contributed to research in topics: Parallel algorithm & Treewidth. The author has an hindex of 1, co-authored 1 publications receiving 21 citations.

Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.

Abstract: In this paper a parallel algorithm is given that, given a graph G=(V,E) , decides whether G is a series parallel graph, and, if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log \kern -1pt |E|log ^\ast \kern -1pt |E|) time and O(|E|) operations on an EREW PRAM, and O(log \kern -1pt |E|) time and O(|E|) operations on a CRCW PRAM. The results hold for undirected as well as for directed graphs.

Combinatorial Optimization on Graphs of Bounded Treewidth

Abstract: There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input graph has bounded treewidth. For combinatorial optimization problems, this is a useful approach for obtaining fixed-parameter tractable algorithms. Starting from trees and series-parallel graphs, we introduce the concepts of treewidth and tree decompositions, and illustrate the technique with the Weighted Independent Set problem as an example. The paper surveys some of the latest developments, putting an emphasis on applicability, on algorithms that exploit tree decompositions, and on algorithms that determine or approximate treewidth and find tree decompositions with optimal or close to optimal treewidth. Directions for further research and suggestions for further reading are also given.

Discovering treewidth

Abstract: Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a given graph, and finding a tree decomposition of small width. Both theoretical results, establishing the asymptotic computational complexity of the problem, as experimental work on heuristics (both for upper bounds as for lower bounds), preprocessing, exact algorithms, and postprocessing are discussed.

Treewidth: structure and algorithms

Abstract: This paper surveys some aspects of the graph theoretic notion of treewidth In particular, we look at the interaction between different characterizations of the notion, and algorithms and algorithmic applications

Branch and Tree Decomposition Techniques for Discrete Optimization

Abstract: This chapter gives a general overview of two emerging techniques for discrete optimiza- tion that have footholds in mathematics, computer science, and operations research: branch decompositions and tree decompositions. Branch decompositions and tree decompositions, along with their respective connectivity invariants, branchwidth and treewidth, were first introduced to aid in proving the graph minors theorem, a well-known conjecture (Wagner's conjecture (103)) in graph theory. The algorithmic importance of branch decompositions and tree decompositions for solving NP -hard problems modeled on graphs was first realized by computer scientists in relation to for- mulating graph problems in monadic second-order logic. The dynamic programming techniques utilizing branch decompositions and tree decompositions, called branch decomposition- and tree decomposition-based algorithms, fall into a class of algorithms known as fixed-parameter tractable algorithms and have been shown to be effective in a practical setting for NP -hard problems such as minimum domination, the traveling salesman problem, general minor containment, and frequency assignment problems.

I/O-efficient algorithms for graphs of bounded treewidth

Abstract: We present I/O-efficient algorithms for the single source shortest path problem and NP-hard problems on graphs of bounded treewidth. The main step in these algorithms is a method to compute a tree-decomposition for the given graph I/O-efficiently.