Bicolored graph partitioning, or: gerrymandering at its worst (Q967425): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.06.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020848182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and Optimization of Electoral Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912822 / rank
 
Normal rank

Latest revision as of 19:28, 2 July 2024

scientific article
Language Label Description Also known as
English
Bicolored graph partitioning, or: gerrymandering at its worst
scientific article

    Statements

    Bicolored graph partitioning, or: gerrymandering at its worst (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    graph partitioning
    0 references
    graph coloring
    0 references
    gerrymandering
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references