Name
Abstract | ||
|---|---|---|
Many combinatorial problems can be efficiently solved in parallel for series parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorith... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1006/jagm.1996.0830 | J. Algorithms |
Keywords | Field | DocType |
series-parallel multigraphs,nc parallel algorithm,series parallel,edge coloring,parallel algorithm,maximum degree | Edge coloring,Discrete mathematics,Combinatorics,Multigraph,Vertex (geometry),Graph colouring,Parallel algorithm,Degree (graph theory),Series and parallel circuits,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 2 | 0196-6774 |
Citations | PageRank | References |
2 | 0.40 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao Zhou | 1 | 325 | 43.69 |
| H. Suzuki | 2 | 238 | 31.31 |
| Takao Nishizeki | 3 | 1771 | 267.08 |