Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q293196 |
Changed an Item |
||
| Property / author | |||
| Property / author: Anders Dessmark / rank | |||
Normal rank | |||
Revision as of 19:36, 12 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
