Shadoks approach to minimum partition into plane subgraphs (CG challenge)

DOI10.4230/lipics.socg.2022.71MaRDI QIDQ6539583

Loïc Crombez, Yan Gerard, G. D. da Fonseca, Aldo Gonzalez-Lorenzo

Publication date: 14 May 2024

zbMATH Keywords

intersection graphgraph coloringcomputational geometryline segmentsplane graphsconflict optimizer

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring ⋮ SAT-boosted tabu search for coloring massive graphs

This page was built for publication: Shadoks approach to minimum partition into plane subgraphs (CG challenge)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539583)