Bounding the Mim-Width of Hereditary Graph Classes.

Nick Brettell Jake Horsfield Andrea Munaro Giacomo Paesani Daniël Paulusma

Published in: CoRR (2020)

Keyphrases

graph representation
bipartite graph
equivalence classes
graph structure
upper bound
random walk
directed graph
connected components
graph matching
directed acyclic graph
graph model
graph theoretic
data sets
graph theory
training data
graph partitioning
clustering algorithm
minimum spanning tree
data mining