Heuristics for semirandom graph problems (Q1604213): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 21:48, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for semirandom graph problems |
scientific article |
Statements
Heuristics for semirandom graph problems (English)
0 references
4 July 2002
0 references
semirandom graph
0 references
independent sets
0 references
colorings
0 references
bisections in graphs
0 references
