4865 search results - page 79 / 973 » The Complexity of Graph Connectivity |
ECOOP
2006
Springer
15 years 1 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
DM
1998
14 years 9 months ago
1998
It has been shown that there is a Hamilton cycle in every connected Cayley graph on any group G whose commutator subgroup is cyclic of prime-power order. This note considers conne...
ALGOSENSORS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
105
click to vote
EJC
2002
14 years 9 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...