On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs.

C. A. Weffort-Santos C. N. Campos Rafael C. S. Schouery

Published in: LAGOS (2019)

Keyphrases

bipartite graph
minimum weight
maximum cardinality
edge weights
maximum matching
link prediction
bipartite graph matching
computational complexity
dynamic programming
worst case
maximum weight
mutual reinforcement
affinity graph