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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees |
scientific article; zbMATH DE number 5599133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees |
scientific article; zbMATH DE number 5599133 |
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
0.911985456943512
0 references
0.8630672097206116
0 references
0.843562662601471
0 references
0.8325631022453308
0 references
