3958 search results - page 416 / 792 » Dynamic Graph Algorithms with Applications |
192
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
172
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
181
Voted
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
205
click to vote
ICCI
1991
15 years 10 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
208
click to vote
DIALM
2004
ACM
16 years 4 days ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...