1201 search results - page 227 / 241 » Linear Probing and Graphs |
100
click to vote
NHM
2010
14 years 7 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
118
Voted
CIKM
2011
Springer
14 years 12 days ago
2011
Springer
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...
116
click to vote
SAS
2009
Springer
16 years 1 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
130
click to vote
MOBIHOC
2002
ACM
16 years 1 days 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...
113
click to vote
DFG
2009
Springer
15 years 7 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...