Results 11 to 20 of about 12,787,233 (297)
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 +2 more sources
Don't use the page number, but a pointer to it [PDF]
Proceedings of the 23rd annual international symposium on Computer architecture, 1996 Most newly announced high performance microprocessors support 64-bit virtual addresses and the width of physical addresses is also growing. As a result, the size of the address tags in the L1 cache is increasing. The impact of on chip area is particularly dramatic when small block sizes are used.
André Seznec
openaire +3 more sources
Recognizing DAGs with Page-Number 2 Is NP-complete [PDF]
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 +6 more sources
Electronic Notes in Discrete Mathematics, 2005 Abstract In this paper we deal with the page number of partially ordered sets (posets). We provide a lower bound in the terms of the jump number and then study posets with page number 2.
Anna Beata Kwiatkowska, Maciej M. Syslo
openaire +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}(
Laura Merker, Torsten Ueckerdt
openaire +3 more sources
On the page number of complete odd-partite graphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konrad Sperfeld
openaire +3 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
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
Every walk’s a hit: making page walks single-access cache hits
International Conference on Architectural Support for Programming Languages and Operating Systems, 2022 As memory capacity has outstripped TLB coverage, large data applications suffer from frequent page table walks. We investigate two complementary techniques for addressing this cost: reducing the number of accesses required and reducing the latency of ...
Chang Hyun Park +3 more
semanticscholar +1 more source