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

Arvind Gupta, Naomi Nishimura

Browse the full STACS paper archive.