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

  • Authors:
  • Arvind Gupta;Naomi Nishimura

  • Affiliations:
  • -;-

  • Venue:
  • STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract