Matching graphs with unique node labels

[1]  Abraham Kandel,et al.  Classification Of Web Documents Using Graph Matching , 2004, Int. J. Pattern Recognit. Artif. Intell..

[2]  A. Snow,et al.  Empirical Evidence of Reliability Growth In Large-Scale Networks , 2004, Journal of Network and Systems Management.

[3]  Abraham Kandel,et al.  Classification of Web documents using a graph model , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..

[4]  Horst Bunke,et al.  On Graphs with Unique Node Labels , 2003, GbRPR.

[5]  Abraham Kandel,et al.  Clustering of Web Documents using a Graph Model , 2003, Web Document Analysis.

[6]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[7]  S. Shenker,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[8]  H. Bunke,et al.  Measuring change in large enterprise data networks , 2002, Final Program and Abstracts on Information, Decision and Control.

[9]  H. Bunke,et al.  Median graphs and anomalous change detection in communication networks , 2002, Final Program and Abstracts on Information, Decision and Control.

[10]  Edwin R. Hancock,et al.  Spectral Feature Vectors for Graph Clustering , 2002, SSPR/SPR.

[11]  T. Caelli,et al.  Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models , 2002, SSPR/SPR.

[12]  Javier Larrosa,et al.  Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.

[13]  Horst Bunke,et al.  Detection of Abnormal Change in a Time Series of Graphs , 2002, J. Interconnect. Networks.

[14]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Marcello Pelillo,et al.  Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Ali Shokoufandeh,et al.  A Unified Framework for Indexing and Matching Hierarchical Shape Structures , 2001, IWVF.

[18]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[19]  Horst Bunke,et al.  Error Correcting Graph Matching: On the Influence of the Underlying Cost Function , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Kuo-Chin Fan,et al.  Genetic-based search for error-correcting graph isomorphism , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  B. Huberman,et al.  Social Dilemmas and Internet Congestions , 1997 .

[24]  Edwin R. Hancock,et al.  Inexact Graph Matching with Genetic Search , 1996, SSPR.

[25]  Horst Bunke,et al.  Including Geometry in Graph Representations: A Quadratic-Time Graph Isomorphism Algorithm and Its Application , 1996, SSPR.

[26]  A. Jagota,et al.  Feasible and infeasible maxima in a quadratic program for maximum clique , 1996 .

[27]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[30]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[31]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[32]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .