Spectral simplification of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3024, Issue , 2004, Pages 114-126

  Qiu, Huaijun ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; MATRIX ALGEBRA;

EXPONENTIAL COMPLEXITY; FIEDLER VECTORS; INEXACT GRAPH MATCHING; LAPLACIAN MATRICES; PARALLEL COMPUTATION; SPECTRAL METHODS; SPECTRAL SIMPLIFICATION; SUBGRAPHS;

GRAPHIC METHODS;

EID: 35048863918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24673-2_10     Document Type: Article

References (19)

1. J. E. Atkins, E. G. Boman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 1998.
2. F.R.K. Chung. Spectral Graph Theory. CBMS series 92. American Mathmatical Society Ed., 1997.
3. J. Diaz, J. Petit, and M. Serna. A survey on graph layout problems. Technical report LSI-00-61-R, Universitat Polit'ecnica de Catalunya, 2000.
4. M. Fiedler. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathematics Journal, 25:619-633, 1975.
5. W.H. Haemers. Interlacing eigenvalues and graphs. Linear Algebra and its Applications, pages 593-616, 1995.
6. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-307, 1970.
7. V. I. Levenshtein. Binary codes capable of correcting deletions insertions and reversals. Soviet Physics-Doklandy, 10(8):707-710, 1966.
8. B. Luo and E. R. Hancock. Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI, 23(10):1120-1136, 2001.
9. B.T. M. and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE PAMI, 20:493-504, 1998.
10. A. Marzal and E. Vidal. Computation of normalized edit distance and applications. IEEE Trans. Systems, Man, and Cybernetics, 25:202-206, 1995.
11. B. Mohar. Some applications of laplace eigenvalues of graphs. Graph Symmetry: Algebraic Methods and Applications, 497 NATO ASI Series C:227-275, 1997.
12. R. Myers, R. C. Wilson, and E. R. Hancock. Bayesian graph edit distance. IEEE PAMI, 22(6):628-635, 2000.
13. L. Shapiro and J. Brady. Feature-based correspondence: an eigenvector approach. Image and Vision Computing, 10(2):283-288, June 1992.
14. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8):888-905, 2000.
15. A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker. Indexing using a spectral encoding of topological structure. IEEE-ICPR, pages 491-497, 1999.
16. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE PAMI, 10:695-703, 1988.
17. R. A. Wagner and M. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.
18. R. C. Wilson and E. R. Hancock. Structural matching by discrete relaxation. IEEE PAMI, 19(6):634-648, 1997.
19. R.J. Wilson and J. J. Watkins. Graphs: an introductory approach: a first course in discrete mathematics. Wiley international edition. New York, etc., Wiley, 1990.