✦ LIBER ✦

A subgraph isomorphism algorithm using resolution

✍ Scribed by J.K. Cheng; T.S. Huang

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 675 KB
Volume: 13
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(81)90093-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel network organization algorithm

Parallel network organization algorithm for graph matching and subgraph isomorphism detection

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

A hough transform technique for subgraph

A hough transform technique for subgraph isomorphism

✍ Simon Kasif; Les Kitchen; Azriel Rosenfeld 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A decision tree approach to graph and su

A decision tree approach to graph and subgraph isomorphism detection

✍ B.T. Messmer; H. Bunke 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 577 KB

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with

Median graph: A new exact algorithm usin

Median graph: A new exact algorithm using a distance based on the maximum common subgraph

✍ M. Ferrer; E. Valveny; F. Serratosa 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A cubic algorithm for the directed Euler

A cubic algorithm for the directed Eulerian subgraph problem

✍ M.B. Richey; R.Gary Parker 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 486 KB