Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time |
scientific article |
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
