2137 search results - page 101 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
147
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
268
click to vote
AAIM
2011
Springer
14 years 5 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
124
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
162
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
111
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...