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

Analysis of approximate algorithms for edge-coloring bipartite graphs

โœ Scribed by Ravi Jain; John Werth

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
513 KB
Volume
54
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A six-color theorem for the edge-face co
A six-color theorem for the edge-face coloring of plane graphs
โœ Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 218 KB

It was shown (Kronk and Mitchen, 1973) that the set of vertices, edges and faces of any normal map on the sphere can be colored with seven colors. In this paper we solve a somewhat different problem: the set of edges and faces of any plane graph with A ~< 3 can be colored by six colors.

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(

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
โœ Haruo Hosoya; K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur