359 search results - page 15 / 72 » Online Algorithms for Disk Graphs |
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
SODA
1992
ACM
14 years 10 months ago
1992
ACM
JEA
2010
14 years 8 months ago
2010
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
ADHOCNOW
2008
Springer
15 years 3 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
PDP
2007
IEEE
15 years 3 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...