1163 search results - page 19 / 233 » Embedding into Bipartite Graphs |
ORL
2007
13 years 7 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...
ORDER
2008
13 years 7 months ago
2008
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
ARSCOM
2007
13 years 8 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
DAM
2010
13 years 8 months ago
2010
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...