𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering the edges of bipartite graphs using graphs

✍ Scribed by Dorit S. Hochbaum; Asaf Levin

Book ID
108281578
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
570 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-Coloring Bipartite Graphs
Edge-Coloring Bipartite Graphs
✍ Ajai Kapoor; Romeo Rizzi πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 65 KB

Given a bipartite graph G with n nodes, m edges, and maximum degree ⌬, we Ž . find an edge-coloring for G using ⌬ colors in time T q O m log ⌬ , where T is the time needed to find a perfect matching in a k-regular bipartite graph with Ž . O m edges and k F ⌬. Together with best known bounds for T th

Independent edges in bipartite graphs ob
Independent edges in bipartite graphs obtained from orientations of graphs
✍ J. G. Gimbel; K. B. Reid πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 800 KB

## Abstract Given a digraph __D__ on vertices __v__~1~, __v__~2~, ⃛, __v__~__n__~, we can associate a bipartite graph __B(D)__ on vertices __s__~1~, __s__~2~, ⃛, __s__~__n__~, __t__~1~, __t__~2~, ⃛, __t__~__n__~, where __s__~__i__~__t__~__j__~ is an edge of __B(D)__ if (__v__~__i__~, __v__~__j__~)