Larry D. Risinger

  • Citations Per Year
Learn More
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring simple undirected graphs. The algorithm is extremely simple, yet, according to the probabilistic analysis, it computes nearly optimal colorings very quickly [12]. We test the algorithm on a number of random as well as non-random graph families. The test cases were(More)
The proposed technique explores a general framework for studying distributed frequency allocation in mobile cellular network. The problem can be abstracted as a multicoloring problem on a cellular graph. This paper concerns a algorithmic problem for solving Maximal independent set of a graph in a distributed fashion and then reducing independent set to(More)
  • 1