✦ LIBER ✦

Subgraph isomorphism, matching relational structures and maximal cliques

✍ Scribed by H.G. Barrow; R.M. Burstall

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum common subgraph isomorphism algo

✍ John W. Raymond; Peter Willett 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 152 KB

Matching free trees, maximal cliques, an

✍ Pelillo, M. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 389 KB

Parallel network organization algorithm

✍ Keita Maehara; Kuniaki Uehara 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

Labeled point pattern matching by Delaun

✍ Hideo Ogawa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Edge-maximal triangulated subgraphs and

✍ Jue Xue 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB

The notions of isomorphism and identity

✍ Jan Waszkiewicz 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 282 KB