Space Complexity of Reachability Testing in Labelled Graphs

2017 ◽  
pp. 351-363
Author(s):  
Vidhya Ramaswamy ◽  
Jayalal Sarma ◽  
K. S. Sunil
Keyword(s):  
Space Complexity ◽  
Reachability Testing ◽  
Labelled Graphs

Space complexity of reachability testing in labelled graphs

2019 ◽  
Vol 105 ◽  
pp. 40-53
Author(s):  
Vidhya Ramaswamy ◽  
Jayalal Sarma ◽  
K.S. Sunil
Keyword(s):  
Space Complexity ◽  
Reachability Testing ◽  
Labelled Graphs

scholarly journals MET: a Java package for fast molecule equivalence testing

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann
Keyword(s):  
Chemical Properties ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Equivalence Classes ◽  
Equivalence Testing ◽  
Equivalence Test ◽  
Graph Isomorphism Problem ◽  
2D Structure ◽  
Node Labels ◽  
Labelled Graphs

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.

Research on Asset Recognition Algorithm of Information Security Product Based on Decision Tree Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li
Keyword(s):  
Computational Complexity ◽  
Information Security ◽  
Decision Tree ◽  
Recognition Algorithm ◽  
Space Complexity ◽  
Complex Relationship ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree

In current, there are complex relationship between the assets of information security product. According to this characteristic, we propose a new asset recognition algorithm (ART) on the improvement of the C4.5 decision tree algorithm, and analyze the computational complexity and space complexity of the proposed algorithm. Finally, we demonstrate that our algorithm is more precise than C4.5 algorithm in asset recognition by an application example whose result verifies the availability of our algorithm.Keywordsdecision tree, information security product, asset recognition, C4.5

On the Time-Space Complexity of Geometric Elimination Procedures

2001 ◽  
Vol 11 (4) ◽  
pp. 239-296 ◽  
Author(s):  
Joos Heintz ◽  
Guillermo Matera ◽  
Ariel Waissbein
Keyword(s):  
Space Complexity ◽  
Time Space

How significant are the known collision and element distinctness quantum algorithms?

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph
Keyword(s):  
Search Algorithm ◽  
Quantum Algorithms ◽  
Search Space ◽  
Space Complexity ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Time Space ◽  
Simple Quantum ◽  
Structured Problems ◽  
Better Than

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.

Sign in / Sign up

Export Citation Format

Share Document