2137 search results - page 153 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
206
click to vote
MEMICS
2010
15 years 1 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
199
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
180
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
167
click to vote
SOFSEM
2007
Springer
16 years 10 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
163
click to vote
FCS
2006
15 years 7 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...