Isomorphism of (mis)labeled graphs
For similarity measures of labeled and unlabeled graphs, we study the complexity of the graph isomorphism problem for pairs of input graphs which are close with respect to the measure. More precisely, we show that for every fixed integer k we can decide in quadratic time whether a labeled graph G can be obtained from another labeled graph H by relabeling at most k vertices. We extend the algorithm solving this problem to an algorithm determining the number ℓ of vertices that must be deleted and...[Show more]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science series|
|01_Schweitzer_Isomorphism_of_(mis)labeled_2011.pdf||211.73 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.