On the hardness of determining the irregularity strength of graphs.

Julien Bensmail

Published in: Theor. Comput. Sci. (2022)

Keyphrases

learning theory
np hard
graph theoretic
graph matching
graph isomorphism
graph mining
graph theory
bipartite graph
directed graph
graph structure
information theoretic
complex structures
graph representation
worst case
graph data
np hardness
feature selection