Sciweavers

1664 search results - page 95 / 333
» Distance labeling in graphs
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
15 years 2 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
CEC
2005
IEEE
15 years 6 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
16 years 5 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 5 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
INFOCOM
2000
IEEE
15 years 8 months ago
On the Placement of Internet Instrumentation
— The IDMaps project aims to provide a distance map of the Internet from which relative distances between hosts on the Internet can be gauged [1]. Many distributed systems and ap...
Sugih Jamin, Cheng Jin, Yixin Jin, Danny Raz, Yuva...