Power balance and apportionment algorithms for the United States Congress

DOI10.1145/297096.297106zbMath1073.68903OpenAlexW1984859821MaRDI QIDQ5463380

No author found.

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/1998/CherkasskyAugment/

zbMATH Keywords

push-relabel method

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Attributed relational graph matching based on the nested assignment structure ⋮ Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well ⋮ An Experimental Study of Algorithms for Online Bipartite Matching ⋮ Why locally-fair maximal flows in client-server networks perform well ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ Parallel algorithms for bipartite matching problems on distributed memory computers ⋮ Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs ⋮ Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs

This page was built for publication: Power balance and apportionment algorithms for the United States Congress