Login / Signup
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.
Torben Hagerup
Jyrki Katajainen
Naomi Nishimura
Prabhakar Ragde
Published in:
SODA (1995)
Keyphrases
</>
network flow
min cost
network flow problem
linear programming
minimum cost
social networks
decision trees
integer programming
computer networks
optimization model
flow patterns
complex networks
knapsack problem
bipartite graph
tree structure
multi objective
integer program
data structure
max flow
training data