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

A simple algorithm for finding a maximum triangle-free -matching in subcubic graphs

โœ Scribed by Yusuke Kobayashi

Book ID
108114393
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
331 KB
Volume
7
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple matching algorithm for regular
A simple matching algorithm for regular bipartite graphs
โœ Kazuhisa Makino; Takashi Takabatake; Satoru Fujishige ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 62 KB

We consider the perfect matching problem for a โˆ†-regular bipartite graph with n vertices and m edges, i.e., 1 2 nโˆ† = m, and present a new O(m + n log n log โˆ†) algorithm. Cole and Rizzi, respectively, gave algorithms of the same complexity as ours, Schrijver also devised an O(mโˆ†) algorithm, and the b