829 search results - page 22 / 166 » Distance domination-critical graphs |
SOCIALCOM
2010
14 years 7 months ago
2010
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
93
Voted
JGT
2008
14 years 9 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
116
click to vote
TSMC
2010
14 years 4 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
METRICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Software architecture is an important form of abstraction, representing the overall system structure and the relationship among components. When software is modified from one ver...