Network-Based Dissolution (Q2922597): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 03:33, 9 July 2024

scientific article

Language	Label	Description	Also known as
English	Network-Based Dissolution	scientific article

Statements

scholarly article

0 references

Network-Based Dissolution (English)

0 references

René van Bevern

0 references

Robert Bredereck

0 references

0 references

0 references

Rolf Niedermeier

0 references

Gerhard J. Woeginger

0 references

Mathematical Foundations of Computer Science 2014

0 references

publication date

14 October 2014

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-44465-8_7

0 references

Generalized planar matching

0 references

Star Partitions of Perfect Graphs

0 references

0 references

On Restricted Two-Factors

0 references

A fair division solution to the problem of redistricting

0 references

A spanning tree heuristic for regional clustering

0 references

An Optimization Based Heuristic for Political Districting

0 references

A computational approach to unbiased districting

0 references

Optimal redistricting under geographical constraints: why ``pack and crack'' does not work

0 references

Multiplying matrices faster than coppersmith-winograd

0 references

Combinatorial and computational aspects of graph packing and graph decomposition

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-44465-8_7

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2922597

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2922597&oldid=35416449"