Randomized Algorithms for Determining the Majority on Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-45138-9_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Randomized Gossip Algorithms for Achieving Consensus on the Majority Vote

IFAC Proceedings Volumes
2013English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Path Algorithms on Regular Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Algorithms for Routing in Planar Graphs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1986English

Algorithms for Dense Graphs and Networks on the Random Access Computer

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1996English

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2011English

Determining Graphs by the Complementary Spectrum

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

External Memory Algorithms for Outerplanar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy