A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs

Andrzej Lingas, Maciej M. Syslo. A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. In Timo Lepistö, Arto Salomaa, editors, Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings. Volume 317 of Lecture Notes in Computer Science, pages 394-409, Springer, 1988.

Abstract

Abstract is missing.