85 search results - page 4 / 17 » Graphs of Bounded Treewidth can be Canonized in AC1 |
JDA
2006
14 years 9 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
SODA
2001
ACM
14 years 10 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...