Approximation algorithms for finding low-degree subgraphs (Q4651931): 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.20031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971422464 / rank | |||
Normal rank | |||
Revision as of 23:23, 19 March 2024
scientific article; zbMATH DE number 2137954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for finding low-degree subgraphs |
scientific article; zbMATH DE number 2137954 |
Statements
Approximation algorithms for finding low-degree subgraphs (English)
0 references
23 February 2005
0 references
approximation algorithms
0 references
minimum-degree subgraphs
0 references
graph algorithms
0 references
network design
0 references
graph connectivity
0 references
NP-hard problems
0 references
