Suchergebnisse - "Graph Theory—Graph algorithms Additional Key Words AND Phrases*"

Quasirandom rumor spreading

Autoren: Benjamin Doerr Tobias Friedrich The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Benjamin Doerr Tobias Friedrich The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.mpi-inf.mpg.de/~doerr/papers/quasirandom_postprint.pdf.

Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms Additional Key Words and Phrases, Distributed computing, rumor spreading, broadcasting, quasirandomness, random

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1804

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1804
http://www.mpi-inf.mpg.de/~doerr/papers/quasirandom_postprint.pdf

Better Distance Preservers and Additive Spanners.

Autoren: BODWIN, GREG WILLIAMS, VIRGINIA VASSILEVSKA

Quelle: ACM Transactions on Algorithms; Oct2021, Vol. 17 Issue 4, p1-24, 24p

Schlagwörter: WRENCHES, UNDIRECTED graphs, ERROR functions, ADDITIVE functions, SUBGRAPHS

Doubly Balanced Connected Graph Partitioning.

Autoren: SOLTAN, SALEH YANNAKAKIS, MIHALIS ZUSSMAN, GIL

Quelle: ACM Transactions on Algorithms; Mar2020, Vol. 16 Issue 2, p1-24, 24p

Schlagwörter: GRAPH connectivity, POLYNOMIAL time algorithms, SUBGRAPHS, ELECTRIC power distribution grids

Quasirandom Rumor Spreading.

Autoren: DOERR, BENJAMIN FRIEDRICH, TOBIAS SAUERWALD, THOMAS

Quelle: ACM Transactions on Algorithms; Oct2014, Vol. 11 Issue 2, p1-35, 35p

Schlagwörter: DISCREPANCY theorem, RANDOM graphs, DISTRIBUTED computing, MATHEMATICAL expansion, PROBABILITY theory, APPROXIMATION algorithms