Using graph diameter for change detection in dynamic networks

Australasian Journal of Combinatorics

Volumn 35, Issue , 2006, Pages 299-311

  Gaston, M E ^a,d   Kraetzl, M ^b   Wallis, W D ^c  

^a Baltimore County   (United States)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^c Southern Illinois University at Carbondale   (United States)

^d ARMED FORCES INSTITUTE OF PATHOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750904572     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. R. Albert, H. Jeong and A. Barabasi, The diameter of the world-wide web, Nature 401 (1999), 130-131.
2. R. Albert, H. Jeong and A. Barabasi, Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
3. H. Bunke, M. Kraetzl, P. J. Shoubridge and W. D. Wallis, Measuring Change in Large Enterprise Data Networks, Proc. Int. Conf. Information, Decision and Control (IEEE, Adelaide, 2002), 53-58.
4. H. Bunke and B. Messmer, Recent advances in graph matching, Internat. J. Pattern Recognition Artif. Intell. 11 (1997), 169-203.
5. H. Bunke, A. Muenger and X. Jiang, Combinatorial search versus genetic algorithms: A case study based on the generalized mean graph problem, Pattern Recognition Lett, 20 (1999), 1271-1277.
6. D. C. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Network robustness and fragility: Percolation on random graphs, Phys. Rev. Lett. 85 (2000), 5468-5471. Available at http://www.arxiv.org/abs/cond-mat/0007300.
7. D. G. Corneil and C. C. Gotlieb, An efficient algorithm for graph isomorphism, J. ACM 17 (1970), 51-64.
8. X. Jiang and H. Bunke, On median graphs: Properties, algorithms, and applications, IEEE Trans. Pattern Anal. Machine Intell. 23 (2001), 1144-1151.
9. X. Jiang, A. Muenger and H. Bunke, Synthesis of representative graphical symbols by computing generalized means, In A. Chhabra, D. Dori (Eds.), Graphical Recognition, LNCS 1941 (Springer-Verlag, 2000), 183-192.
10. B.T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. Pattern Anal. & Machine Intell. 20 (1998), 493-504.
11. A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Systems, Man. Cyber. 13 (1983), 353-362.
12. P. Shoubridge, M. Kraetzl and D. Ray, Detection of abnormal change in dynamic networks, In Proc. Int. Conf. Information, Decision and Control, IEEE, Adelaide, 1999, 557-562.
13. P. J. Shoubridge, M. Kraetzl, W. D. Wallis and H. Bunke, Detection of abnormal change in a time series of graphs, J. Interconnection Networks 3 (2002), 85-101.
14. J. R. Ullman, An algorithm for subgraph isomorphism, J. ACM 23 (1976), 3142.
15. W. D. Wallis, P. J. Shoubridge, M. Kraetzl and D. Ray. Graph distances using graph union, Pattern Recognition Letters 22 (2001), 701-704.
16. D. J. Watts, Small Worlds, Princeton University Press, 1999.
17. D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, 393 (1998), 440-442.
18. D. B. West, Introduction to Graph Theory (Prentice Hall, New Jersey, 1996).