1206 search results - page 21 / 242 » Arc-Flags in Dynamic Graphs |
161
Voted
IMCSIT
2010
15 years 24 days ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
121
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
120
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
125
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— We discuss a framework for defining physical open systems on higher-dimensional complexes. We start with the formalization of the dynamics of open electrical circuits and the ...