API for dpmcsuss/iGraphMatch
Tools for approximately solving graph matching problems

Global functions
bari_start Man page Source code
best_matches Man page Source code
cal_mark Source code
center_graph Man page Source code
check_cycle Source code
check_seeds Man page Source code
conflict_check Source code
fix_hard_D Source code
fix_hard_corr Source code
g2_hard_seeding Source code
graph_match_ExpandWhenStuck Man page Source code
graph_match_FW Man page Source code
graph_match_convex Man page Source code
graph_match_convex_directed Source code
graph_match_percolation Man page Source code
graph_match_soft_percolation Man page Source code
init_start Man page Source code
low_rank_approx Source code
mean_row_diff Source code
rds_perm_bari Source code
rds_perm_bari_start Man page Source code
rds_sinkhorn Source code
rds_sinkhorn_start Man page Source code
row_cor Man page Source code
row_diff Man page Source code
row_diff_perm Source code
row_perm_stat Man page Source code
rperm Man page Source code
sample_correlated_gnp_pair Man page Source code
sample_correlated_gnp_pair_w_junk Man page Source code
sample_correlated_ieg_pair Man page Source code
sample_correlated_rdpg Man page Source code
sample_correlated_sbm_pair Man page Source code
sample_correlated_sbm_pair_w_junk Man page Source code
sinkhorn Source code
swap_order Source code
var_row_diff Source code
dpmcsuss/iGraphMatch documentation built on Dec. 18, 2018, 2:07 p.m.