Results 11 to 20 of about 199,356 (267)
Upward Partitioned Book Embeddings [PDF]
, 2018 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). Given a directed acyclic graph and a partition of its edges into $k$ pages, can we linearly order the vertices such that the drawing is upward (a topological sort) and ...
Akitaya, Hugo A. +3 more
openaire +4 more sources
SAT for Upward Book Embedding: An Empirical Study
Proceedings of the Canadian Conference on Artificial IntelligenceRustem Kakimov, Xing Tan
openalex +3 more sources
Book Embeddings of Graph Products
CoRR, 2020 A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book thickness, page number) of a graph is the minimum $k$ such that it admits a $k$-stack layout.
openaire +2 more sources
Upward Book Embeddings of st-Graphs
CoRR, 2019 We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering along the spine of the book. We show that testing whether a graph admits a $k$UBE is NP-complete for
Carla Binucci +5 more
openaire +5 more sources
New wine in old bottles: current developments in digital delivery and dissemination [PDF]
, 2009 The purpose of this paper is to identify and assess current developments in scholarly publishing in Europe. Current models for disseminating content have limitations and Open Access models of publishing have been endorsed by the European Universities ...
Ayris, P.
core +1 more source
On exteriority notions in book embeddings and treewidth
Discrete Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Baudru, Séverine Fratani
openaire +2 more sources
The Planar Tree Packing Theorem [PDF]
, 2016 Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a
Geyer, Markus +4 more
core +2 more sources
Laguerre Geometry of Hypersurfaces in $\R^n$
, 2006 Laguerre geometry of surfaces in $\R^3$ is given in the book of Blaschke [1], and have been studied by E.Musso and L.Nicolodi [5], [6], [7], B. Palmer [8] and other authors. In this paper we study Laguerre differential geometry of hypersurfaces in $\R^n$.
Li, Tongzhu, Wang, Changping
core +2 more sources
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source