1729 search results - page 232 / 346 » On Bounds for the k-Partitioning of Graphs |
204
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
148
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
171
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
145
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
192
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...