137 search results - page 25 / 28 » Locally connected spanning trees on graphs |
125
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
119
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
133
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
146
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
130
click to vote
IPMU
1992
Springer
15 years 5 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...