On computational complexity of graph inference from counting

DOI10.1007/S11047-012-9349-2MaRDI QIDQ269786zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi

Publication date 6 April 2016

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-012-9349-2

zbMATH Keywords

computational complexityspectrumtree-decompositioncountingde novo drug designgraph inferencewalk history

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Publication:4952629
• Combinatorial Pattern Matching
• A detachment algorithm for inferring a graph from path frequency
• Generation of molecular graphs based on flexible utilization of the available structural information
• Inferring a graph from path frequency

Cites work

• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3353267 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A detachment algorithm for inferring a graph from path frequency
• A partial k-arboretum of graphs with bounded treewidth
• Absoluteness of subword inequality is undecidable
• Combinatorial Pattern Matching
• Connected Treewidth and Connected Graph Searching
• Graph minors. II. Algorithmic aspects of tree-width
• Graph theory
• On Context-Free Languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Subword histories and Parikh matrices

Cited in

(8)

• A detachment algorithm for inferring a graph from path frequency
• A Detachment Algorithm for Inferring a Graph from Path Frequency
• scientific article; zbMATH DE number 5247142 (Why is no real title available?)
• scientific article; zbMATH DE number 2059949 (Why is no real title available?)
• One-reversal counter machines and multihead automata: revisited
• Generative network complex (GNC) for drug discovery
• scientific article; zbMATH DE number 1445315 (Why is no real title available?)
• CDGCN: conditional de novo drug generative model using graph convolution networks

This page was built for publication: On computational complexity of graph inference from counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269786)