187 search results - page 34 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
AVI
2004
15 years 1 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
114
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
104
Voted
WWW
2003
ACM
16 years 11 days ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The o...
DAC
2000
ACM
16 years 20 days ago
2000
ACM
The proliferation of the Internet has a ected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of...