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

Algorithm for the Cost Edge-Coloring of Trees

โœ Scribed by Xiao Zhou; Takao Nishizeki

Book ID
111592085
Publisher
Springer US
Year
2004
Tongue
English
Weight
113 KB
Volume
8
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear time algorithm for edge colorin
A linear time algorithm for edge coloring of binomial trees
โœ M. Kubale; K. Piwakowski ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

Parallel Algorithms for the Edge-Colorin
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
โœ Weifa Liang; Xiaojun Shen; Qing Hu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with โŒฌ ฯฉ 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires โŒฌ or โŒฌ ฯฉ 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that ะˆ(G) ี… 3โŒฌ/2 [16]. A number of parallel algorithms