Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
The complexity and dynamic nature of travelling offers many opportunities for technological support. But printed guidebooks remain the typical companion, despite many weaknesses. ...