On computational complexity of graph inference from counting
DOI10.1007/S11047-012-9349-2zbMATH Open1333.68141OpenAlexW2079011386MaRDI QIDQ269786FDOQ269786
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
Recommendations
computational complexityspectrumtree-decompositioncountingde novo drug designgraph inferencewalk history
Analysis of algorithms and problem complexity (68Q25) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A partial k-arboretum of graphs with bounded treewidth
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- On Context-Free Languages
- Title not available (Why is that?)
- A detachment algorithm for inferring a graph from path frequency
- Subword histories and Parikh matrices
- Connected Treewidth and Connected Graph Searching
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- Absoluteness of subword inequality is undecidable
Cited In (7)
- A Detachment Algorithm for Inferring a Graph from Path Frequency
- One-reversal counter machines and multihead automata: revisited
- A detachment algorithm for inferring a graph from path frequency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generative network complex (GNC) for drug discovery
- Title not available (Why is that?)
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)
