239 search results - page 1 / 48 » The path partition problem and related problems in bipartite... |
ORL
2007
13 years 4 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
IPL
2007
13 years 5 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
TCS
2010
13 years 9 hour ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
ECCC
2010
13 years 5 days ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
ICML
2004
IEEE
14 years 6 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...