Sciweavers

829 search results - page 30 / 166
» Distance domination-critical graphs
Sort
View
JOI
2011
140views more  JOI 2011»
14 years 6 months ago
A bibliometric index based on the collaboration distance between cited and citing authors
The popular h-index used to measure scientific output can be described in terms of a pool of evaluated objects (the papers), a quality function on the evaluated objects (the numb...
Maria Bras-Amorós, Josep Domingo-Ferrer, Vi...
CVPR
2009
IEEE
16 years 7 months ago
Locally Constrained Diffusion Process on Locally Densified Distance Spaces with Applications to Shape Retrieval
The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus bein...
Xingwei Yang (Temple University), Suzan Koknar-Tez...
INFOCOM
2008
IEEE
15 years 6 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
SAGA
2007
Springer
15 years 6 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
ISPAN
2002
IEEE
15 years 4 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen