A detachment algorithm for inferring a graph from path frequency

Algorithmica (New York)

Volumn 53, Issue 2, 2009, Pages 207-224

  Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Connectivity; Detachment algorithm; Graph inference; Multigraphs

Indexed keywords

CHEMICAL STRUCTURES; CONNECTIVITY; DETACHMENT ALGORITHM; DRUG DESIGNS; EFFICIENT ALGORITHMS; GRAPH INFERENCE; LOOPLESS; MULTIGRAPHS; MULTIPLE SETS; POTENTIAL APPLICATIONS; VERTEX-LABELED GRAPHS;

ALGORITHMS;

INFERENCE ENGINES;

EID: 60649083386     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9184-0     Document Type: Article

References (18)

1. Akutsu, T., Fukagawa, D.: Inferring a graph from path frequency. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 3537, pp. 371-382 (2005)
2. Akutsu, T., Fukagawa, D.: On inference of a chemical structure from path frequency. In: Proceedings of the 2005 International Joint Conference of InCoB, AASBi and KSBI, pp. 96-100 (2005)
3. G.H. Bakir J. Weston B. Schölkopf 2004 Learning to find pre-images Adv. Neural Inf. Proc. Syst. 16 449 456
4. Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Proceedings of the 26th DAGM Symposium, Lecture Notes in Computer Science, vol. 3175, pp. 253-261 (2004)
5. A.R. Berg B. Jackson T. Jordán 2003 Highly edge-connected detachments of graphs and digraphs J. Graph Theory 43 67 77
6. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley-Interscience, New York (1998)
7. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)
8. W.H. Cunningham 1986 Improved bounds for matroid partition and intersection algorithms SIAM J. Comput. 15 948 957
9. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R.K., Hanani, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69-87. Gordon & Breach, New York (1970)
10. A. Frank 1981 A weighted matroid intersection algorithm J. Algorithms 2 328 336
11. Fukunaga, T., Nagamochi, H.: Some theorems on detachments preserving local-edge-connectivity. In: Proceedings of the fifth CRACOW Conference on Graph Theory. Electronic Notes in Discrete Mathematics, vol. 24, pp. 173-180 (2006)
12. B. Jackson T. Jordán 2003 Non-separable detachments of graphs J. Comb. Theory B 87 17 37
13. Jansson, J., Sadakane, K.: Private communication
14. Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of the 20th International Conference on Machine Learning, pp. 321-328 (2003)
15. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2000)
16. E.L. Lawler 1975 Matroid intersection algorithms Math. Program. 9 31 56
17. S.J.A. Nash-Williams 1985 Connected detachments of graphs and generalized Euler trails J. Lond. Math. Soc. 31 17 29
18. G. Pólya 1937 Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen Acta Math. 68 145 254