10 citations · 25 across the 28 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017
Recognizing Weak Embeddings of Graphs
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding of a graph into a 2-manifold maps…
cs.CG2017
Upward Partitioned Book Embeddings
Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg +1
We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding…