Graph Pooling with Maximum-Weight k-Independent Sets.

Davide Bacciu Alessio Conte Francesco Landolfi

Published in: CoRR (2022)

Keyphrases

maximum weight
bipartite graph matching
bipartite graph
minimum weight
bipartite matching
weighted graph
independent set
partial order
np hard
association rules
special case
random walk
shortest path
graph structure
minimum spanning tree
association graph