2137 search results - page 119 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
131
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
142
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
144
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
160
click to vote
ICML
2008
IEEE
16 years 5 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...
141
click to vote
PAMI
2010
15 years 3 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...