Results 11 to 20 of about 1,114,025 (267)
On the Page Number of Upward Planar Directed Acyclic Graphs
Journal of Graph Algorithms and Applications, 2013 In this paper we study the page number of upward planar directed acyclic graphs. We prove that: (1) the page number of any n-vertex upward planar triangulation G whose every maximal 4-connected component has page number k is at most min{O(klogn),O(2k)}; (
Fabrizio Frati +2 more
doaj +1 more source
Front Cover Jurnal Sisfokom (Sistem Informasi dan Komputer) Vol. 9 No. 2 Juli 2020
Jurnal Sisfokom, 2020 This article contains front-matter of Jurnal Sisfokom (Sistem Informasi dan Komputer), Volume 9 Number 2 - July 2020, which includes a cover page, title page, editorial team, and table of contents.
Editor in Chief Sisfokom
doaj +1 more source
BMC Research Notes, 2022 Objectives This manuscript provides novel insights about the potential use of social media (a Facebook page, the first strategic attempt by EviDent initiative) to share evidence-based dentistry content and empowerment strategies for professionals, using ...
Gabriela M. Machado, Mariana M. Braga
doaj +1 more source
Automated Page Turner for Musicians
Frontiers in Artificial Intelligence, 2020 An increasing number of musicians are opting to use tablet devices instead of traditional print media for their music sheets since the digital medium offers the benefit of storing a lot of music in a compact space.
André Tabone +2 more
doaj +1 more source
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Journal of Graph Algorithms and Applications, 2018 We investigate crossing minimization for $1$-page and $2$-page book drawings. We show that computing the $1$-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing $2$-page planarity is fixed-parameter ...
Michael Bannister, David Eppstein
doaj +1 more source
Front Cover Jurnal Sisfokom (Sistem Informasi dan Komputer) Vol. 9 No. 1 Maret 2020
Jurnal Sisfokom, 2020 This article contains front-matter of Jurnal Sisfokom (Sistem Informasi dan Komputer), Volume 9 Number 1 - March 2020, which includes a cover page, title page, editorial team, and table of contents.
Editor in Chief Sisfokom
doaj +1 more source
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
Open Computer Science, 2015 We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei +3 more
doaj +1 more source
Local and Union Page Numbers [PDF]
, 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}(
Laura Merker, Torsten Ueckerdt
openaire +2 more sources
Frontiers in Psychology, 2017 Do children spontaneously represent spatial-numeric features of a task, even when it does not include printed numbers (Mix et al., 2016)? Sixty first grade students completed a novel spatial estimation task by seeking and finding pages in a 100-page book
Clarissa A. Thompson +2 more
doaj +1 more source
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
Journal of Applied Mathematics, 2017 The crossing number of graph G is the minimum number of edges crossing in any drawing of G in a plane. In this paper we describe a method of finding the bound of 2-page fixed linear crossing number of G. We consider a conflict graph G′ of G.
A. Suebsriwichai, T. Mouktonglang
doaj +1 more source