677 search results - page 15 / 136 » Bipartite roots of graphs |
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
DM
2006
13 years 7 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
SIAMCO
2008
13 years 7 months ago
2008
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...