1395 search results - page 132 / 279 » (k, )-Distance-Hereditary Graphs |
140
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
132
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
148
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
151
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
282
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...