✦ LIBER ✦

Shock Graphs and Shape Matching

✍ Scribed by Kaleem Siddiqi; Ali Shokoufandeh; Sven J. Dickinson; Steven W. Zucker

Book ID: 110258599
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 437 KB
Volume: 35
Category: Article
ISSN: 0920-5691
DOI: 10.1023/a:1008102926703

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching graphs

✍ Eroh, Linda; Schultz, Michelle 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

The matching graph M (G) of a graph G is that graph whose vertices are the maximum matchings in G and where two vertices M 1 and M 2 of M (G) this graph models a metric space whose metric is defined on the set of maximum matchings in G. Which graphs are matching graphs of some graph is not known in

Matchings and matching extensions in gra

Matchings and matching extensions in graphs

✍ Ciping Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let G be a graph with a perfect matching and k be an integer such that l~<k< I V(G)l/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K~,s-free graph of even order is k-extendable. In this p

Shape recognition from large image libra

Shape recognition from large image libraries by inexact graph matching

✍ Benoit Huet; Edwin R. Hancock 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Matching and symmetry of graphs

✍ Haruo Hosoya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Matching signatures and Pfaffian graphs

✍ Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Collapsible graphs and matchings

✍ Zhi-Hong Chen; Hong-Jian Lai 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ ⊆ __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi