4865 search results - page 866 / 973 » The Complexity of Graph Connectivity |
GCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
MOBICOM
2004
ACM
15 years 3 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
CSL
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...