112 search results - page 3 / 23 » Improved algorithms for hypergraph bipartitioning |
111
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
ICWS
2007
IEEE
14 years 11 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
DAM
2010
14 years 10 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE