Abstract
Given a graph G = (V, E) with a vertex ordering <=, the FIXED-ORDER BOOK THICKNESS problem asks whether there is a page assignment sigma such that ......
小提示:本篇文献需要登录阅读全文,点击跳转登录

