2137 search results - page 187 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
185
click to vote
ISAAC
2007
Springer
16 years 17 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
194
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
159
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
168
click to vote
IWPEC
2009
Springer
16 years 29 days ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
171
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...