Graph Isomorphism Implementation in LEDA 5 . 1
نویسنده
چکیده
منابع مشابه
Implementation of a Linear Expected-Time Algorithm for Finding Connected Components
We describe a robust and efficient implementation of the Karp and Tarzan [4] algorithm for finding the connected components of an undirected graph. The algorithm achieves to find the connected components of a graph G = (V,E) in O(|V|) expected time. The implementation of the algorithm (called GCOMPONENTS) is based on the LEDA library of efficient data types and algorithms [5,6,7]. This is the f...
متن کاملImplementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
In this paper we describe robust and eecient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of eecient data types and algorithms 18]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently implemented in LEDA. The rst algorithm is the Ka...
متن کاملEecient, Adaptable Implementations of Graph Algorithms
EEciency, exibility, and ease of use are desirable goals in library design. However, these goals seem to contradict each other. The Library of Ecient Algorithms and Data Structures (LEDA) focuses on eeciency and ease of use. On the other hand, we have developed concepts for the implementation of algorithms which focus on eeciency and exibility. In this paper, we present a possible combination o...
متن کاملThe Graphlet System ( System Demonstration )
Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a portable le format for graphs. The implementation and visualization of graph algorithms is an important ...
متن کاملData Dependent Hardware for Subgraph Isomorphism Problem
Subgraph isomorphism problem has various important applications, while it is generally NP-complete and difficult to solve. Though Ullmann’s algorithm can be implemented by parallel hardware to accelerate the execution, it requires too much hardware to implement. This paper examines the feasibility of data dependent circuit for subgraph isomorphism problem. Logic gates are generally reducible if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005