On computational complexity of graph inference from counting

[1]  Shinnosuke Seki,et al.  Absoluteness of subword inequality is undecidable , 2011, Theor. Comput. Sci..

[2]  Hiroshi Nagamochi,et al.  A Detachment Algorithm for Inferring a Graph from Path Frequency , 2009, Algorithmica.

[3]  Hiroshi Nagamochi,et al.  Enumerating Treelike Chemical Graphs with Given Path Frequency , 2008, J. Chem. Inf. Model..

[4]  Nicolas Nisse,et al.  Connected Treewidth and Connected Graph Searching , 2006, LATIN.

[5]  Tatsuya Akutsu,et al.  Inferring a Graph from Path Frequency , 2005, CPM.

[6]  Alexander Zien,et al.  Learning to Find Graph Pre-images , 2004, DAGM-Symposium.

[7]  Arto Salomaa,et al.  Subword histories and Parikh matrices , 2004, J. Comput. Syst. Sci..

[8]  Bernhard Schölkopf,et al.  Learning to Find Pre-Images , 2003, NIPS.

[9]  Eleazar Eskin,et al.  The Spectrum Kernel: A String Kernel for SVM Protein Classification , 2001, Pacific Symposium on Biocomputing.

[10]  H. Bodlaender.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[11]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[12]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[13]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[14]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[15]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[16]  Reinhard Diestel,et al.  Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.

[17]  Erik Massop.  Hilbert's tenth problem , 2012 .

[18]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[19]  Atsuko Yamaguchi,et al.  Graph Complexity of Chemical Compounds in Biological Pathways , 2003 .

[20]  Susumu Goto,et al.  LIGAND: database of chemical compounds and reactions in biological pathways , 2002, Nucleic Acids Res..

[21]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .