—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
Stavros D. Nikolopoulos, Andreas Pitsillides, Davi...
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...