68 search results - page 10 / 14 » Computing Graph Roots Without Short Cycles |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Step caches are caches in which data entered to an cache array is kept valid only until the end of ongoing step of execution. Together with an advanced pipelined multithreaded arc...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
IICS
2003
Springer
14 years 1 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
SIAMDM
2010
13 years 3 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...