Package: iGraphMatch 2.0.5.9000

Abstract | Introduction | Graph matching background | Assignment problems | Graph matching algorithms | Relaxation-based algorithms | Frank Wolfe methodology | PATH algorithm | Percolation-based algorithms | Percolation Algorithm | ExpandWhenStuck Algorithm | Spectral-based algorithm | IsoRank Algorithm | Umeyama algorithm | Auxiliary graph matching tools | Centering technique | Padding graphs of different orders | Exploiting sparse and low-rank structure | LAP methods | Multi-layered graph matching | Correlated random graph models | Measures for goodness of matching | R functions and usage | Sampling correlated random graph pairs | Graph matching methods | Evaluation of goodness of matching | Examples | Example: Enron Email Network Data | Visualization of Enron networks | Matching largest connected components using FW Algorithm | Centering the larger graph | Matching with adaptive seeds | Core vertices detection | Example: C. Elegans Network Data | A challenging task | Soft matching: MAP@3 | Example: Britain Transportation Network | Conclusions | References