Results 1 to 10 of about 11,537,342 (378)
The mixed page number of graphs
Theoretical Computer Science, 2022 A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +3 more sources
Journal of Formalized Reasoning, 2008 We discuss the formalization, in the Matita Interactive Theorem Prover, of a few elementary results in number theory about the Moebius mu function and the Euler phi function.
Cristian Armentano, Andrea Asperti
doaj +2 more sources
Iranian Journal of Public Health, 2016 Background: Citation metrics and total publications in a field has become the gold standard for rating researchers and viability of a field. Hence, stimulating demand for citation has led to a search for useful strategies to improve performance metric ...
Abubakar AHMED +4 more
doaj +2 more sources
Local and Union Page Numbers [PDF]
International Symposium Graph Drawing and Network Visualization, 2019 We introduce the novel concepts of local and union book embeddings, and, as the corresponding graph parameters, the local page number ${\rm pn}_\ell(G)$ and the union page number ${\rm pn}_u(G)$. Both parameters are relaxations of the classical page number ${\rm pn}(G)$, and for every graph $G$ we have ${\rm pn}_\ell(G) \leq {\rm pn}_u(G) \leq {\rm pn}(
Merker, Laura, Ueckerdt, Torsten
openaire +3 more sources
Recognizing DAGs with Page-Number 2 is NP-complete [PDF]
International Symposium Graph Drawing and Network Visualization, 2022 The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the ...
M. Bekos +5 more
semanticscholar +1 more source
A Sublinear Bound on the Page Number of Upward Planar Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2021 The page number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut +2 more
semanticscholar +1 more source
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
About right: references in open-access EGU (European Geosciences Union) journals [PDF]
Geoscience Communication, 2021 We investigated the number of references per page for different European Geosciences Union journals, which share the same text formatting. Although the journals formally all focus on geoscience, different disciplines are covered, from ocean science and ...
A. Pozzer
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +1 more source