Sciweavers

863 search results - page 3 / 173
» Links in edge-colored graphs
Sort
View
106
Voted
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
15 years 1 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
55
Voted
COMBINATORICS
1999
59views more  COMBINATORICS 1999»
14 years 11 months ago
List Edge-Colorings of Series-Parallel Graphs
Martin Juvan, Bojan Mohar, Robin Thomas
97
Voted
DAM
2010
116views more  DAM 2010»
14 years 11 months ago
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...