Results 1 to 10 of about 8,167 (118)
Closing the Feedback Loop: Improving Communication of Findings With Aboriginal Research Participants Through Participatory Action Research [PDF]
Health ExpectationsBackground Communication of research findings often lacks appropriately tailored messaging to meet participants' expectations and needs. Guidelines for communicating with Aboriginal and Torres Strait Islander Peoples exist but are not widely applied in ...
Stephanie Smith +6 more
doaj +2 more sources
IEEE AccessBook recommendations are crucial in digital library transformation, enhancing service sophistication and customization. They allow readers to access books tailored to their specific interests.
Yafeng Kong
exaly +3 more sources
The matching book embeddings of pseudo-Halin graphs
Electronic Journal of Graph Theory and Applications, 2023 The book embedding of a graph G is to arrange the set of points of the graph on a line (spine) and embed the edges on the half-plane bounded by the spine so that the edges in the same page do not intersect with each other.
Zeling Shao +3 more
doaj +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
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
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
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
Parameterized Algorithms for Book Embedding Problems
Journal of Graph Algorithms and Applications, 2020 A $k$-page book embedding of a graph $G$ draws the vertices of $G$ on a line and the edges on $k$ half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether $G$ admits a $k$-
Sujoy Bhore +3 more
doaj +1 more source
Steganography via E-Books With the EPUB Format by Rearrangements of the Contents of the CSS Files
IEEE Access, 2020 With the advance of information technology and mobile devices, e-book reading has become a popular way for people to gain knowledge. However, with the widespread uses of digital texts, issues about the copyright protection of e-books have arisen.
Da-Chun Wu, Hsiu-Yang Su
doaj +1 more source
Four pages are indeed necessary for planar graphs
Journal of Computational Geometry, 2020 An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum
Michael Kaufmann +5 more
doaj +1 more source