Author:
Schieber Tiago A.,Carpi Laura,Díaz-Guilera Albert,Pardalos Panos M.,Masoller Cristina,Ravetti Martín G.
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy,General Biochemistry, Genetics and Molecular Biology,General Chemistry
Reference56 articles.
1. Kelmans, A. K. Comparison of graphs by their number of spanning trees. Discrete Math. 16, 241–261 (1976).
2. Garey, M. R. & Johnson, D. S. Computers and Intractability: a Guide to the Theory of NP-Completeness W. H. Freeman & Co. (1979).
3. IEEE, T., Pattern Anal Bunke, H. & Shearer, K. A graph distance metric based on the maximal common subgraph. Pattern. Recogn. Lett. 19, 255–259 (1998).
4. Fernandez, M. L. & Valiente, G. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern. Recogn. Lett. 22, 753–758 (2001).
5. Luo, B. & Hancock, E. R. Structural graph matching using the EM algorithm and singular value decomposition. IEEE T. Pattern. Anal. 23, 1120–1136 (2001).
Cited by
167 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献