Results 11 to 20 of about 10,822,126 (305)

An Improved Upper Bound on the Queue Number of Planar Graphs

open access: yesAlgorithmica, 2022
AbstractAk-queue layout is a special type of a linear layout, in which the linear order avoids$$(k+1)$$(k+1)-rainbows, that is,$$k+1$$k+1independent edges that pairwise form a nested pair. The optimization goal is to determine thequeue numberof a graph, which is defined as the minimum value ofkfor which ak-queue layout is feasible.
Michael Bekos   +2 more
openaire   +3 more sources

On the Queue Number of Planar Graphs [PDF]

open access: yes2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010
We prove that planar graphs have poly-logarithmic queue number, thus improving upon the previous polynomial upper bound. Consequently, planar graphs admit 3D straight-line crossing-free grid drawings in small volume.
Di Battista, Giuseppe   +2 more
openaire   +4 more sources

The Local Queue Number of Graphs with Bounded Treewidth [PDF]

open access: yesInternational Symposium Graph Drawing and Network Visualization, 2020
Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
Merker, Laura, Ueckerdt, Torsten
openaire   +5 more sources

Stack number and queue number of graphs [PDF]

open access: yesarXiv.org, 2023
In this paper we give an overview of the graph invariants queue number and stack number (the latter also called the page number or book thickness). Due to their similarity, it has been studied for a long time, whether one of them is bounded in terms of the other. It is now known that the stack number is not bounded by the queue number.
Adam Straka
openaire   +3 more sources

The Queue-Number of Posets of Bounded Width or Height [PDF]

open access: yesInternational Symposium Graph Drawing and Network Visualization, 2018
Heath and Pemmaraju conjectured that the queue-number of a poset is bounded by its width and if the poset is planar then also by its height. We show that there are planar posets whose queue-number is larger than their height, refuting the second conjecture.
Knauer, Kolja   +2 more
openaire   +7 more sources

Track Drawings of Graphs with Constant Queue Number [PDF]

open access: yesInternational Symposium Graph Drawing and Network Visualization, 2004
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [9] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number ...
DI GIACOMO, Emilio, Meijer H.
openaire   +4 more sources

On the queue-number of the hypercube

open access: yesElectronic Notes in Discrete Mathematics, 2011
Abstract A queue layout of a graph consists of a linear ordering σ of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to σ . A queue-number of G is the minimal number of queues in a queue layout of G .
Petr Gregor   +2 more
openaire   +2 more sources

On Linear Layouts of Graphs [PDF]

open access: yesDiscrete 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

Fishing vessel queue model in Kutaraja Fishing Port: Case study of Wharf Pias II [PDF]

open access: yesE3S Web of Conferences, 2022
Kutaraja international Fishing Port is one of the biggest port with highest activity in Aceh Province. Nevertheless, when unloading process, fishing vessel often occur long queue of fishing vessel.
Rahayu Rosi   +3 more
doaj   +1 more source

Distributed Queuing in Dynamic Networks [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected.
Gokarna Sharma, Costas Busch
doaj   +1 more source

Home - About - Disclaimer - Privacy