Results 281 to 290 of about 3,644,444 (342)
Some of the next articles are maybe not open access.
Embedding generalized Petersen graph in books
Chinese Annals of Mathematics, Series B, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Bin +3 more
openaire +3 more sources
Topological Book Embedding of Bipartite Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006A topological book embedding of a graph is an embedding in a book that carries the vertices in the spine of the book and the edges in the pages so that edges are allowed to cross the spine. Recently, the author has shown that for an arbitrary graph G with n vertices there exists a d+1-page book embedding of G in which each edge crosses the spine logdn ...
M. Miyauchi
openaire +2 more sources
Embedding dialog reading into AR picture books
Interactive Learning Environments, 2023Parent–child reading critically affects children’s learning and development, and dialog reading (DR) is a highly effective strategy for parent–child reading.
Kuo-En Chang +3 more
semanticscholar +1 more source
Book Embeddings of Regular Graphs
SIAM Journal on Discrete Mathematics, 2015Summary: In the influential papers in which \textit{M. Malitz} [J. Algorithms 17, No. 1, 71--84 (1994; Zbl 0810.68102); ibid. No. 1, 85--109 (1994; Zbl 0810.68103)] proved that every graph with \(m\) edges can be embedded in a book with \(O({m}^{1/2})\) pages, he proved the existence of \(d\)-regular \(n\)-vertex graphs that require \(\Omega(\sqrt{d}n^{
Balogh, József, Salazar, Gelasio
openaire +2 more sources
The 4-dimensional disc embedding theorem and dual spheres
Selecta Mathematica, 2020We modify the proof of the disc embedding theorem for 4-manifolds, which appeared as Theorem 5.1A in the book “Topology of 4-manifolds” by Freedman and Quinn, in order to construct geometrically dual spheres.
Mark Powell, Arunima Ray, P. Teichner
semanticscholar +1 more source
Embedding Model Design for Producing Book Recommendation
International Conference on Information Management and Technology, 2019Internet services often recommend contents to users in order to maintain the interaction. Recommendation system plays a major role to formulate and produce a series of recommendation based on users’ behavior. Surprisingly, user-generated scoring or known
Reza Rahutomo +3 more
semanticscholar +1 more source
A Tight Subexponential-time Algorithm for Two-Page Book Embedding
International Colloquium on Automata, Languages and ProgrammingA book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line.
R. Ganian +4 more
semanticscholar +1 more source
Degree constrained book embeddings
Journal of Algorithms, 2002Summary: A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine) and an assignment of edges to half-planes with the spine as boundary (the pages) so that edges assigned to the same page can be drawn on that page without crossings.
openaire +2 more sources
Afrika Matematika
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin +3 more
openaire +2 more sources
Embedding Outerplanar Graphs in Small Books
SIAM Journal on Algebraic Discrete Methods, 1987A book consists of a number of half-planes (pages) sharing a common boundary line (the spine). A book embedding of a graph embeds the vertices on the spine and each edge in some page so that each page contains a plane subgraph. The width of a page is the maximum number of edges that intersect any half-line perpendicular to the spine in the page.
openaire +2 more sources

