Paper
30 October 2006 Storage and manipulations of directed graph based on OBDD
Yanru Zhong, Meifa Huang, Tianlong Gu
Author Affiliations +
Abstract
Ordered binary decision diagram (OBDD) is a new kind of typical graph-based data structures for representing Boolean expressions. Combinatorial explosions are inevitable when storing and manipulating large graphs by conventional data structures. OBDD provides the deleting and merging rules to realize the compressed storage of graphs. This paper presents a new method of storage and manipulations of directed graph based on OBDD. The vertices of directed graph are coded in binary scale so as to express the vertices in Boolean expressions. The edges of directed graph are therefore expressed in Boolean relations. In this way, the directed graph can be represented by OBDD. With such representations, we can use the available algorithms based on OBDD and the manipulations of directed graph are implemented by employing the operations of Boolean functions. The manipulations realized in this paper include computing the input and/or output degrees of the vertices of directed graphs, inserting edges into the graph, deleting edges from the graph, locating the edges, and traversing the graph in breadth-first search. A simulation experiment is provided with various kinds of random generated directed graph. The experimental results demonstrate that the storage of directed graph based on OBDD is more efficient than that of by adjacency list when dealing with large directed graph.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yanru Zhong, Meifa Huang, and Tianlong Gu "Storage and manipulations of directed graph based on OBDD", Proc. SPIE 6358, Sixth International Symposium on Instrumentation and Control Technology: Sensors, Automatic Measurement, Control, and Computer Simulation, 63585I (30 October 2006); https://doi.org/10.1117/12.718310
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Data storage

Logic

Automatic control

Computer engineering

Detection and tracking algorithms

Visualization

RELATED CONTENT

Text segmentation of machine-printed Gurmukhi script
Proceedings of SPIE (December 21 2000)
Pattern matching by scan-converting polygons
Proceedings of SPIE (July 15 2004)
Similarity retrieval of motion capture data as time-series
Proceedings of SPIE (December 02 2005)
A decimal carry-free adder
Proceedings of SPIE (February 28 2005)

Back to Top