85 search results - page 9 / 17 » Graphs of Bounded Treewidth can be Canonized in AC1 |
MST
2010
14 years 7 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
114
click to vote
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...