Distance (graph theory)

Known as: Eccentricity (graph theory), Graph metric, Distance (disambiguation) 
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020040019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We present an approach for identifying a set of candidate objects in a given image. This set of candidates can be used for object… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A 3D shape signature is a compact representation for some essence of a shape. Shape signatures are commonly utilized as a fast… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, an online induction motor diagnosis system using motor current signature analysis (MCSA) with advanced signal-and… (More)
  • figure 1
  • figure 2
  • table I
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present an unsupervised algorithm for registering 3D surface scans of an object undergoing significant deformations. Our… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We introduce a very fast and reliable method for shape similarity retrieval in large image databases which is robust with respect… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The user of an image database often wishes to retrieve all images similar to the one (s)he already has. Using some features like… (More)
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
 
Is this relevant?