1395 search results - page 133 / 279 » (k, )-Distance-Hereditary Graphs |
169
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
172
click to vote
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
153
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
138
click to vote
EJC
2010
15 years 4 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
124
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...