مرکز منطقه ای اطلاع رساني علوم و فناوري - A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

Title of article :

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

Author/Authors :

Vicente Valls، نويسنده , , Rafael Marti، نويسنده , , Pilar Lino، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 1996

Pages :

From page :

303

To page :

319

Keywords :

branch and bound , Automatic graph drawing , Crossing arcs minimization , Bipartite graphs

Journal title :

European Journal of Operational Research

Serial Year :

1996

Journal title :

European Journal of Operational Research

Record number :

211634

Link To Document :