Computational mathematics - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-07-11 14:03:09 Graph theory Mathematics Computational complexity theory Edsger W. Dijkstra Combinatorial optimization Network theory Maximal independent set Graph coloring Shortest path problem Matching Leader election Minimum spanning tree		Add to Reading List Source URL: security.cs.georgetown.edu Download Document from Source Website File Size: 362,19 KB Share Document on Facebook

	Quantum Leader Election S. Tani, H. Kobayashi, K. Matsumoto, Y. Okubo, X,-B. Wang, Y.-K. Jiang, A. Tomita LNCS3404, ); arXiv:; PRA77, Quantum Leader Election DocID: 1ufoL - View Document
	Gathering Asynchronous Oblivious Mobile Robots in a Ring Ralf Klasing1 , Euripides Markou2,? , and Andrzej Pelc3,?? 1 2 DocID: 1r6G6 - View Document
	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + DocID: 1r62H - View Document
	The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda Zhao DocID: 1qVmW - View Document
	Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen DocID: 1qUdZ - View Document