Login / Signup
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems.
Banu Kabakulak
Z. Caner Taskin
Ali Emre Pusane
Published in:
Networks (2020)
Keyphrases
</>
communication systems
graph construction
learning algorithm
similarity measure
data sets
np hard
expectation maximization
computer systems
neural network
decision trees
prior knowledge
semi supervised
data processing
undirected graph
label propagation