Sciweavers

3396 search results - page 271 / 680
» Tree representations of graphs
Sort
View
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
15 years 7 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
DAM
2008
82views more  DAM 2008»
15 years 6 months ago
Closest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
SIAMJO
2008
144views more  SIAMJO 2008»
15 years 5 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...
SSPR
2004
Springer
15 years 11 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
CISS
2007
IEEE
15 years 10 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami