๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple algorithm for edge-coloring bipartite multigraphs

โœ Scribed by Noga Alon

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
52 KB
Volume
85
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Linear Algorithm for Edge-Coloring Ser
A Linear Algorithm for Edge-Coloring Seriesโ€“Parallel Multigraphs
โœ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 313 KB

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 obta

An NC Parallel Algorithm for Edge-Colori
An NC Parallel Algorithm for Edge-Coloring Seriesโ€“Parallel Multigraphs
โœ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

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 algorithm has been obtained for seriesแŽparallel multigraphs. This paper gives an NC parallel algorithm for the