Establishes NP-hardness of three graph similarity measures under tighter restrictions than prior work and derives inequalities for strongly regular graphs with complexity consequences.
Then gi ·hj = g′ k ·h′ l if and only if gis ·hjs = g′ ks ·h′ ls
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Three Hardness Results for Graph Similarity Problems
Establishes NP-hardness of three graph similarity measures under tighter restrictions than prior work and derives inequalities for strongly regular graphs with complexity consequences.