Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:49, 1 February 2024
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
