An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
Kai Chen, David R. Choffnes, Rahul Potharaju, Yan ...
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...