1664 search results - page 22 / 333 » Distance labeling in graphs |
112
Voted
CPC
2006
15 years 1 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
141
Voted
JCT
2008
15 years 1 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
109
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
118
Voted
DAM
2011
14 years 9 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...