Search for Author All Reviews
	Eppstein, David     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       The effect of faults on network expansion Bagchi A., Bhargava A., Chaudhary A., Eppstein D., Scheideler C. Theory of Computing Systems 39(6): 903-928, 2006.  Type: Article Faults are a normal aspect of network operations--indeed, they are commonplace and expected in mobile networks. The authors study the problem of how resilient networks are to node faults. They focus on how many faults a networ...... Nov 13 2007     3-coloring in time O(1.3289) Beigel R., Eppstein D. Journal of Algorithms 54(2): 168-204, 2005.  Type: Article The main result of this paper is a proof that the three-coloring problem can be solved in worst-case time O(1.3289n). The previous record for this problem was the O(1....... Jul 5 2005     Sparsification--a technique for speeding up dynamic graph algorithms Eppstein D., Galil Z., Italiano G., Nissenzweig A. Journal of the ACM 44(5): 669-696, 1997.  Type: Article As the authors observe, “graph algorithms are fundamental in computer science,” and therefore, so are the data structures that facilitate them. This paper introduces a data structure called a sparsification tree, wh...... Jun 1 1998
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy