Suchergebnisse - "sublinear-time deterministic parallel algorithms"

Sublinear-Time Parallel Algorithms for Matching and Related Problems: Sublinear-time parallel algorithms for matching and related problems

Autoren: P. M. Vaidya Andrew V. Goldberg Serge Plotkin

Quelle: Journal of Algorithms. 14:180-213

Schlagwörter: flows in zero-one networks, Deterministic network models in operations research, depth-first search, 0211 other engineering and technologies, Distributed algorithms, bipartite matching, sublinear-time deterministic parallel algorithms, 0102 computer and information sciences, 02 engineering and technology, minimum-cost flow, 01 natural sciences, maximal node-disjoint paths

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/166206
https://doi.org/10.1006/jagm.1993.1009
https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21935
https://ieeexplore.ieee.org/document/21935/
https://www.computer.org/csdl/proceedings-article/focs/1988/021935/12OmNz4SOtG
https://dblp.uni-trier.de/db/conf/focs/focs88.html#GoldbergPV88
https://dblp.uni-trier.de/db/journals/jal/jal14.html#GoldbergPV93
https://dl.acm.org/doi/10.1006/jagm.1993.1009
https://www.sciencedirect.com/science/article/pii/S0196677483710096
http://www.sciencedirect.com/science/article/pii/S0196677483710096