SWAT
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
AINA
2010
IEEE
13 years 9 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
HSNMC
2004
Springer
13 years 10 months ago
2004
Springer
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
