Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...