Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629): 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/s11590-009-0146-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090216307 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes |
scientific article |
Statements
Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (English)
0 references
4 October 2010
0 references
independent set
0 references
graph coloring
0 references
co-\(k\)-plex
0 references
\(k\)-dependent set
0 references
defective coloring
0 references
\(t\)-improper coloring
0 references
