Traversal with Enumeration of Geometric Graphs in Bounded Space
نویسندگان
چکیده
منابع مشابه
A Bounded-Space Tree Traversal Algorithm
An algorithm for traversing binary trees in linear time using constant extra space is presented. The algorithm offers advantages to both Robson traversal and Lindstrom scanning. Under certain conditions, the algorithm can be applied to the marking of cyclic list structures. The algorithm can be generalized to handle N-trees and N-lists.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملI/O and Space-Efficient Path Traversal in Planar Graphs
We present a technique for representing bounded-degree planar graphs succinctly while permitting I/O-efficient path traversal. To represent a graph G on N vertices, each with an associated key of q = O(lgN) bits, we use Nq +O(N) + o(Nq) bits. Using this representation, a path of length K can be traversed with O(K/ lgB) I/Os, where B is the disk block size. Our structure may be adapted to repres...
متن کاملFast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate that, on average, CFR significantly outperforms the best known geometric routing algorithms in the path stretch: the speed of message delivery. Its performance approaches the shortest possible path. CFR maintains its adv...
متن کاملBounded Length, 2-Edge Augmentation of Geometric Planar Graphs
Algorithms for the construction of spanning planar subgraphs of Unit Disk Graphs (UDGs) do not ensure connectivity of the resulting graph under single edge deletion. To overcome this deficiency, in this paper we address the problem of augmenting the edge set of planar geometric graphs with straight line edges of bounded length so that the resulting graph is planar and 2-edge connected. We give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Interconnection Networks
سال: 2019
ISSN: 0219-2659,1793-6713
DOI: 10.1142/s0219265919500087