1729 search results - page 1 / 346 » On Bounds for the k-Partitioning of Graphs |
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
COMBINATORICA
1999
13 years 4 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
ECCC
2000
13 years 4 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...