External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width

Arvind Gupta, Naomi Nishimura. Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. In Claude Puech, Rüdiger Reischuk, editors, STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Volume 1046 of Lecture Notes in Computer Science, pages 453-464, Springer, 1996.

Abstract

Abstract is missing.

runs on