365 search results - page 48 / 73 » Reconfigurations in Graphs and Grids |
PC
2007
13 years 10 months ago
2007
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
DLOG
2009
13 years 8 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
APPROX
2008
Springer
14 years 28 days ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
GD
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
GD
1999
Springer
14 years 3 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...