Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning (Q4904584)
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: Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning |
scientific article; zbMATH DE number 6132892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning |
scientific article; zbMATH DE number 6132892 |
Statements
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning (English)
0 references
30 January 2013
0 references
plane graph partitioning
0 references
political districting
0 references
local search
0 references
0.8491854071617126
0 references
0.8444595336914062
0 references
0.8024839758872986
0 references
0.7859906554222107
0 references
0.7715150713920593
0 references
