Sciweavers

3267 search results - page 192 / 654
» Generalized quasirandom graphs
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal
WWW
2007
ACM
16 years 7 months ago
Comparing apples and oranges: normalized pagerank for evolving graphs
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
WWW
2007
ACM
16 years 7 months ago
Estimating the cardinality of RDF graph patterns
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
16 years 22 days ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
15 years 10 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...