290 search results - page 8 / 58 » Local Partitioning for Directed Graphs Using PageRank |
142
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
147
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
130
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
129
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
140
Voted
IEEECIT
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...