266 search results - page 42 / 54 » Graphs with Bounded Induced Distance |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
OA
1989
14 years 1 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
JSYML
2010
13 years 3 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
SIGMOD
2010
ACM
14 years 28 days ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...