Conflict-based local search for minimum partition into plane subgraphs (CG challenge) (Q6539584)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conflict-based local search for minimum partition into plane subgraphs (CG challenge) |
scientific article; zbMATH DE number 7849070
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conflict-based local search for minimum partition into plane subgraphs (CG challenge) |
scientific article; zbMATH DE number 7849070 |
Statements
Conflict-based local search for minimum partition into plane subgraphs (CG challenge) (English)
0 references
14 May 2024
0 references
local search
0 references
planar graph
0 references
graph colouring
0 references
geometric graph
0 references
conflict optimizer
0 references
