Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642)
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: Maximum packing for k-connected partial k-trees in polynomial time |
scientific article; zbMATH DE number 1454400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time |
scientific article; zbMATH DE number 1454400 |
Statements
Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (English)
0 references
4 June 2000
0 references
algorithm
0 references
time complexity
0 references
subgraph
0 references
isomorphism
0 references
matching
0 references
0.9147172
0 references
0.91356075
0 references
0.9028048
0 references
0.90241337
0 references
0 references
0.9021287
0 references
0.9007801
0 references
0.89771587
0 references
0.89626133
0 references
