1996•Lecture notes in computer scienceRequires access

Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width

Arvind Gupta, Naomi Nishimura

Open publisher page 14 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Induced subgraph isomorphism problem, Combinatorics, Bounded function, Subgraph isomorphism problem, Graph isomorphism, Induced path, Induced subgraph, Longest path problem

Back to paper search Browse research topics Original source

Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width — Research Paper | ScholarLens