Results 51 to 60 of about 11,505 (254)

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming

Algorithms, 2018
Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this ...
Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil   +3 more
doaj   +1 more source

Packing Directed Circuits Quarter-Integrally [PDF]

, 2019
Nie ...
, Muzi, Irene, Pilipczuk, Marcin, Rzazewski, Pawel, Sorge, Manuel   +4 more
core   +1 more source

Constant-degree graph expansions that preserve the treewidth

, 2007
Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth.
I.L. Markov, Igor L. Markov, J. Håstad, N. Robertson, N. Robertson, P. Alimonti, P. Saxena, R. Dechter, R. Dechter, R. Diestel, S. Arnborg, S.L. Lauritzen, V.E. Alekseev, Yaoyun Shi   +13 more
core   +2 more sources

Bisection of Bounded Treewidth Graphs by Convolutions [PDF]

, 2019
In the Bisection problem, we are given as input an edge-weighted graph G. The task is to find a partition of V(G) into two parts A and B such that ||A| - |B||
Eiben, Eduard, Lokshtanov, Daniel, Mouawad, Amer E.   +2 more
core   +2 more sources

On Exact Algorithms for Treewidth

ACM Transactions on Algorithms, 2006
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time O
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos   +4 more
openaire   +5 more sources

A structural approach to kernels for ILPs: Treewidth and Total Unimodularity [PDF]

, 2015
Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-the-art ILP-solvers like CPLEX.
A. Atamtürk, E.J. Kim, H. Dell, H.L. Bodlaender, H.L. Bodlaender, M. Dom, M.W.P. Savelsbergh, S. Kratsch   +7 more
core   +2 more sources

The pathwidth and treewidth of cographs [PDF]

SIAM Journal on Discrete Mathematics, 1990
Summary: It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.
Hans L. Bodlaender, Rolf H. Möhring
openaire   +2 more sources

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Algorithms, 2019
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj   +1 more source

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]

, 2010
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar, Toran, Jacobo, Wagner, Fabian   +2 more
core   +5 more sources

Turbocharging Treewidth Heuristics [PDF]

Algorithmica, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele   +4 more
openaire   +3 more sources