1 paper · 2 filters
Henry Förster, Michael Hoffmann, Stephen Kobourov +3
We introduce and study the weighted book thickness of graphs. A k-page book embedding of a graph G=(V,E) is defined by a spanning cycle C for V (which does not need to be p…