Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57010789, #quickstatements; #temporary_batch_1709550817224 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:20, 5 March 2024
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
