✦ LIBER ✦

WSM: a novel algorithm for subgraph matching in large weighted graphs

✍ Scribed by Anupam Bhattacharjee, Hasan M. Jamil

Book ID: 113069663
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 409 KB
Volume: 38
Category: Article
ISSN: 0925-9902
DOI: 10.1007/s10844-011-0178-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A (sub)graph isomorphism algorithm for m

A (sub)graph isomorphism algorithm for matching large graphs

✍ Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 549 KB

A combinatorial algorithm for weighted s

A combinatorial algorithm for weighted stable sets in bipartite graphs

✍ Ulrich Faigle; Gereon Frahling 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Belief Propagation and LP Relaxation for

Belief Propagation and LP Relaxation for Weighted Matching in General Graphs

✍ Sanghavi, S.; Malioutov, D.; Willsky, A. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 228 KB

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB

A novel algorithm for chromatogram match

A novel algorithm for chromatogram matching in qualitative analysis

✍ Mason, John P. ;Kirk, Ian ;Windsor, Colin G. ;Tipler, Andy ;Spragg, Richard A. ; 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

## Abstract The matching of the pattern of peaks produced during gas chromatography is of importance to many applications. At present, this task is generally performed manually, but this generates the usual problems associated with human inspection, such as a lack of objectivity and reproducibility

A simple algorithm for finding a maximum

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

✍ Yusuke Kobayashi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 331 KB