Packing cuts in undirected graphs (Q4812395): 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.1002/net.20008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2137293391 / rank | |||
Normal rank | |||
Revision as of 02:28, 20 March 2024
scientific article; zbMATH DE number 2093900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing cuts in undirected graphs |
scientific article; zbMATH DE number 2093900 |
Statements
Packing cuts in undirected graphs (English)
0 references
20 August 2004
0 references
packing
0 references
edge-disjoint cuts
0 references
independent set
0 references
complexity
0 references
approximation
0 references
linear programming relaxation
0 references
