Fast Schulze voting using quickselect

DOI10.7155/JGAA.V30I1.3030MaRDI QIDQ7357273zbMATH OpenFDO

Authors Arushi Arora, David Eppstein, Randy Le Huynh

Publication date 25 September 2026

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V30I1.3030

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• A Theorem on Boolean Matrices
• Aggregation of Preferences with Variable Electorate
• Decremental strongly-connected components and single-source reachability in near-linear time
• Exponential bounds for the running time of a selection algorithm
• Fast algorithms for (, )-matrix multiplication and bottleneck shortest paths
• scientific article; zbMATH DE number 3150488 (Why is no real title available?)
• More asymmetry yields faster matrix multiplication

This page was built for publication: Fast Schulze voting using quickselect

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