Name
Abstract | ||
|---|---|---|
Many combinatorial problems can be efficiently solved for series–parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obtained for series–parallel multigraphs. This paper gives a linear algorithm for the problem on series–parallel multigraphs. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jagm.1996.0008 | J. Algorithms |
Keywords | Field | DocType |
series-parallel multigraphs,linear algorithm,edge coloring,series parallel | Graph theory,Edge coloring,Discrete mathematics,Graph,Combinatorics,Multigraph,Graph colouring,Linear algorithm,Series and parallel circuits,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 1 | 0196-6774 |
Citations | PageRank | References |
10 | 0.84 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao Zhou | 1 | 325 | 43.69 |
| H. Suzuki | 2 | 238 | 31.31 |
| Takao Nishizeki | 3 | 1771 | 267.08 |