882 search results - page 161 / 177 » On the Hardness of Graph Isomorphism |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...