✦ LIBER ✦

Faster Algorithms for Subgraph Isomorphism ofsl k-Connected Partialsl k-Trees

✍ Scribed by A. Dessmark; A. Lingas; A. Proskurowski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of subgraph isomorphism f

✍ Arvind Gupta; Naomi Nishimura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 882 KB

Memory Requirements for Table Computatio

✍ B. Aspvall; J. A. Telle; A. Proskurowski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 149 KB

A faster parallel algorithm for k-connec

✍ K. Iwama; C. Iwamoto; T. Ohsawaa 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Polynomial algorithms for graph isomorph

✍ Hans L Bodlaender 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 783 KB

A branch-and-cut algorithm for the k-edg

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 1 views