Sciweavers

677 search results - page 35 / 136
» Bipartite roots of graphs
Sort
View
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
13 years 11 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
CORR
2010
Springer
40views Education» more  CORR 2010»
13 years 10 months ago
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N....
DM
2006
72views more  DM 2006»
13 years 9 months ago
Sparse anti-magic squares and vertex-magic labelings of bipartite graphs
A sparse anti-magic square is an n
I. D. Gray, Jim A. MacDougall