Old Web
English
Sign In
Acemap
>
Paper
>
Maximum C4-free bipartite graphs and knapsack-type programs
Maximum C4-free bipartite graphs and knapsack-type programs
1993
Tibor Illés
Krarup J
Keywords:
Combinatorics
Knapsack problem
Bipartite graph
Mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI
[]