Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees |
scientific article |
Statements
Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (English)
0 references
27 August 2009
0 references
computational complexity
0 references
graph algorithms
0 references
maximum common subgraph
0 references
