Results 11 to 20 of about 11,309,322 (372)
Deciding whether graph G has page number one is in NC [PDF]
Information Processing Letters, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shozo Naito, Shigeru Masuyama
openaire +5 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
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
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
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
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
Recognizing DAGs with Page-Number 2 Is NP-complete
Theoretical Computer Science, 2023 Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)
Michael A. Bekos +5 more
openaire +5 more sources
Analysis of visits to ScienceCentral, an open access full-text archive of scientific society journal literature [PDF]
Science Editing, 2017 ScienceCentral is a free or open access full-text archive of scientific society journal literature hosted by the Korean Federation of Science and Technology Societies. It was launched in December 2013.
Younsang Cho, Sun Huh
doaj +1 more source
Erratum Jurnal Psikologi Volume 49, Number 2 in August 2022
Jurnal Psikologi, 2022 This erratum is to explain a pagination error occurred in the published issue of Jurnal Psikologi Volume 25, Number 1 (1998). The error above was due to problem in scanning the printed version of the article that caused one needless page slipped between ...
Erratum Jurnal Psikologi
doaj +1 more source