✦ LIBER ✦

The graph matching problem

✍ Scribed by Livi, Lorenzo; Rizzi, Antonello

Book ID: 120568110
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 1013 KB
Volume: 16
Category: Article
ISSN: 1433-7541
DOI: 10.1007/s10044-012-0284-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear programming approach for the we

A linear programming approach for the weighted graph matching problem

✍ Almohamad, H.A.; Duffuaa, S.O. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 395 KB

The Complexity of the Matching-cut Probl

The Complexity of the Matching-cut Problem for Various Graph Classes

✍ Paul Bonsma 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 228 KB

F-factors of graphs: A generalized match

F-factors of graphs: A generalized matching problem

✍ Jo¨rg Mu¨hlbacher 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Maximum induced matching problem on hhd-

Maximum induced matching problem on hhd-free graphs

✍ Chandra Mohan Krishnamurthy; R. Sritharan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 292 KB

An eigendecomposition approach to weight

An eigendecomposition approach to weighted graph matching problems

✍ Umeyama, S. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 725 KB

The complexity of the matching-cut probl

The complexity of the matching-cut problem for planar graphs and other graph classes

✍ Paul Bonsma 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg