Results 301 to 310 of about 3,592,441 (346)
Some of the next articles are maybe not open access.
Embedding iterated line digraphs in books
Networks, 2002AbstractIn this paper, we present an upper bound on the pagenumber of an iterated line digraph Lk(G) of a digraph G. Our bound depends only on the digraph G and is independent of the number of iterations k. In particular, it is proved that the pagenumber of Lk(G) does not increase with the number of iterations k.
openaire +2 more sources
A survey on book-embedding of planar graphs
Frontiers of Mathematics in China, 2022Xiaxia Guan +3 more
semanticscholar +1 more source
The Book Thickness of 1-Planar Graphs is Constant
Algorithmica, 2015In a book embedding, the vertices of a graph are placed on the “spine” of a book and the edges are assigned to “pages”, so that edges on the same page do not cross.
M. Bekos +3 more
semanticscholar +1 more source
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
Book Embedding of Graphs on the Projective Plane
SIAM Journal on Discrete Mathematics, 2019For a positive integer $k$, a book (with $k$ pages) is a topological space consisting of a spine, which is a line, and $k$ pages, which are half-planes with the spine as their boundary.
Takayuki Nozawa +2 more
openaire +2 more sources
Book embedding of complex network with community structure
Applied Mathematics and Computation, 2019Abstract Community structure provides useful information for understanding the organization structure of a network and the interaction between different functional modules, as a result, it has been a hot research topic in the study of complex network. In graph theory, a complex network with a community structure is a stochastic block model (SBM). The
Bin Zhao +3 more
openaire +2 more sources
Book review: Designing Embedded Hardware
ACM SIGPLAN Notices, 2006My last column finished up a two-part retrospective to recap the first ten years of ACM Sigplan Notices Forth Report . If you have access to back issues of Sigplan or ACM Portal , you must have enjoyed the review that much more. I hope so.
openaire +2 more sources
Arabic terms in embedded book indexes
The Indexer, 2019Texts that include names or terms that use special characters with diacritics can present difficulties for indexers, and more so when the index is embedded in Microsoft Word or another program.
openaire +2 more sources
Efficient deterministic algorithms for embedding graphs on books
1996We derive deterministic polynomial time algorithms for book embedding of a graph G = (V, E), ¦V¦ = n and ¦E¦ = m. In particular, we present the first deterministic polynomial time algorithm to embed any bipartite graph in \(O(\sqrt m )\)pages. We then use this algorithm to embed, in polynomial time, any graph G in \(O(\sqrt {\delta ^ * (G) \cdot m ...
Weiping Shi, Farhad Shahrokhi
openaire +2 more sources