57 search results - page 4 / 12 » Approximating Sparsest Cut in Graphs of Bounded Treewidth |
146
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
309
click to vote
ECCC
2011
15 years 29 days ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
152
click to vote
SODA
2001
ACM
15 years 7 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 ...
171
click to vote
PAMI
2007
15 years 5 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
146
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...