Sciweavers

1447 search results - page 68 / 290
» Graphs and Path Equilibria
Sort
View
135
Voted
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
15 years 5 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
ICHIT
2009
Springer
15 years 10 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
255
Voted
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 5 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
129
Voted
ISPAN
2002
IEEE
15 years 8 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
150
Voted
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 10 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...