𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for finding a maximum -matching excluding complete partite subgraphs

✍ Scribed by Yusuke Kobayashi; Xin Yin

Book ID
113567731
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
524 KB
Volume
9
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

A 2-Approximation Algorithm for Finding
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
✍ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ε½ . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs Ε½ and of k-out-connected graphs i.e., graphs which contain a vertex