47 search results - page 10 / 10 » How to draw the minimum cuts of a planar graph |
PPL
2000
13 years 4 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...