Login / Signup
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.
Kyousuke Yamashita
Ryuji Masui
Xiang Zhou
Chenxi Wang
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
Published in:
CoRR (2020)
Keyphrases
</>
pairwise
chemical compounds
shortest path
graph theoretic
graph matching
graph databases
directed graph
subgraph isomorphism
high level
random graphs
graph representation
formal specification
graph theory
minimum cost
optimal path
graph data
functional requirements
graph structure
web services
delay insensitive