Comparing large graphs efficiently by margins of feature vectors-Reference-Cited by-同舟云学术

Comparing large graphs efficiently by margins of feature vectors

Published:2007-05 Issue:2 Volume:188 Page:1699-1710
ISSN:0096-3003
Container-title:Applied Mathematics and Computation
language:en
Short-container-title:Applied Mathematics and Computation

Author:

Dehmer Matthias,Emmert-Streib Frank

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference25 articles.

1. Algorithms and Applications;Bang-Jensen,2000

2. What is the distance between graphs;Bunke;Bulletin of the EATCS,1983

3. H. Bunke, G. Allermann, A metric on graphs for structural pattern recognition, in: H.W. Schüssler (Ed.), Signal Processing II: Theory and Applications, 1983, pp. 257–260.

4. H. Bunke, Graph matching: Theoretical foundations, algorithms, and applications, in: Proceedings of Vision Interface 2000, Montreal/Canada, 2000, pp. 82–88.

5. P.A. Champin, C. Solnon, Measuring the similarity of labeled graphs, in: Proceedings of the Fifth International Conference on Case-Based Reasoning, Trondheim, Springer Verlag, Berlin, 2003, pp. 80–95.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Corporate Structure Complexity and Cost of Debt;FINANC UVER;2023

2. Combining kinetic orders for efficient S-System modelling of gene regulatory network;Biosystems;2022-10

3. Dynamically Regulated Initialization for S-system Modelling of Genetic Networks;2021 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB);2021-10-13

4. Comparing large-scale graphs based on quantum probability theory;Applied Mathematics and Computation;2019-10

5. Network science in clinical trials: A patient-centered approach;Seminars in Cancer Biology;2018-10