Packing cycles exactly in polynomial time (Q421271): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-010-9347-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057309492 / rank | |||
Normal rank | |||
Revision as of 02:50, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing cycles exactly in polynomial time |
scientific article |
Statements
Packing cycles exactly in polynomial time (English)
0 references
23 May 2012
0 references
packing and covering
0 references
polynomial algorithm
0 references
min-max relation
0 references
maximum cycle packing
0 references
