发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

Vicente Valls; Rafael Martí; Pilar Lino

作者Vicente Valls; Rafael Martí; Pilar Lino
卷第90卷
期第2期
印刷ISSN0377-2217
文件大小1132.49KB
发表时间1996
DOI10.1016/0377-2217(95)00356-8
页码303-319

← 返回【学霸图书馆】主页