Login / Signup
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.
Lucas Colucci
Péter L. Erdös
Ervin Györi
Tamás Róbert Mezei
Published in:
Theor. Comput. Sci. (2019)
Keyphrases
</>
bipartite graph
maximum matching
disjoint paths
edge weights
graph model
bipartite graph matching
link prediction
maximum weight
graph clustering
minimum weight
bipartite networks
maximum cardinality
machine learning
np hard
mutual reinforcement