Sciweavers

64 search results - page 3 / 13
» Node ranking in labeled directed graphs
Sort
View
PODC
2003
ACM
13 years 11 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
GD
1998
Springer
13 years 10 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 14 days ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
VLDB
2004
ACM
138views Database» more  VLDB 2004»
13 years 11 months ago
ObjectRank: Authority-Based Keyword Search in Databases
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
Andrey Balmin, Vagelis Hristidis, Yannis Papakonst...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 8 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu