1729 search results - page 207 / 346 » On Bounds for the k-Partitioning of Graphs |
169
click to vote
FSTTCS
2009
Springer
16 years 29 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
194
click to vote
IFM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
177
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
142
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
126
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...