829 search results - page 39 / 166 » Distance domination-critical graphs |
106
click to vote
AVSS
2009
IEEE
14 years 9 months ago
2009
IEEE
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
ENDM
2007
14 years 11 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
WG
1998
Springer
15 years 4 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
EOR
2006
14 years 12 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...