Results 261 to 270 of about 3,366,127 (326)

Impact of the COVID-19 Pandemic and the 2021 National Institute for Health and Care Excellence Guidelines on Public Perspectives Toward Myalgic Encephalomyelitis/Chronic Fatigue Syndrome: Thematic and Sentiment Analysis on Twitter (Rebranded as X).

J Med Internet Res
Khakban I, Jain S, Gallab J, Dharmaraj B, Zhou F, Lokker C, Abdelkader W, Zeraatkar D, Busse JW.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Topological Book Embedding of Bipartite Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
A 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.
M. Miyauchi
semanticscholar   +3 more sources

Book Embedding of Toroidal Bipartite Graphs

SIAM Journal on Discrete Mathematics, 2012
Endo proved that every toroidal graph has a book embedding with at most seven pages. In this paper, we prove that every toroidal bipartite graph has a book embedding with at most five pages.
Atsuhiro Nakamoto, K. Ota, K. Ozeki
semanticscholar   +3 more sources

Embedding generalized Petersen graph in books

Chinese Annals of Mathematics, Series B, 2016
A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the
Bin Zhao, W. Xiong, Yingzhi Tian, J. Meng   +3 more
semanticscholar   +3 more sources

Embedding the mesh in books [PDF]

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005., 2005
In this paper, we study the linear layout problem of the rectangular mesh by the embedding-in-book technique. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges residing in a page do not cross. We propose a scheme to embed an h /spl times/ w rectangular mesh with two pages and book width Min(h,w ...
Ka-Lok Ng, Po-Han Lee, Chien-Hung Huang, Jywe-Fei Fang, Erh-Ying Yen   +4 more
openaire   +1 more source

Upward Topological Book Embeddings of DAGs [PDF]

SIAM Journal on Discrete Mathematics, 2011
Let G be a directed acyclic graph (DAG). An upward (k,h)-topological book embedding of G is an upward book embedding on k pages of a subdivision of G where every edge is replaced by a path having at most h+2 vertices. In this paper it is proved that every DAG with n vertices admits an upward (d+1, 2⌈logdn⌉-1)-topological book embedding, where d is any ...
DI GIACOMO, Emilio, F. Giordano, LIOTTA, Giuseppe   +2 more
openaire   +2 more sources

Degree constrained book embeddings [PDF]

Journal of Algorithms, 2002
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   +1 more source

Book Embeddings of Regular Graphs

SIAM Journal on Discrete Mathematics, 2015
In the influential paper in which he proved that every graph with $m$ edges can be embedded in a book with $O({m}^{1/2})$ pages, Malitz proved the existence of $d$-regular $n$-vertex graphs that require $\Omega(\sqrt{d}n^{\frac{1}{2}-\frac{1}{d}})$ pages. In view of the $O({m}^{1/2})$ bound, this last bound is tight when $d > \log{n}$, and Malitz asked
Gelasio Salazar, József Balogh
openaire   +1 more source