570 search results - page 7 / 114 » Edge Coloring with Delays |
AAIM
2008
Springer
15 years 3 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper examines burst contention resolution problems in optical burst switching (OBS) networks. Since burst contentions take place i) when the network is congested by incre...
ENDM
2002
14 years 9 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...