Results 1  10
of
26,450
Simulating a stack by queues
"... Abstract We explore the complexity relationships between finite automata endowed with various data structures as auxiliary stores. It is shown that a queue automata, a finite state machine endowed with one or more queues, are Turing Equivalent. A finite automata with two stacks can simulate a (one) ..."
Abstract
 Add to MetaCart
of these auxiliary structures. Hence, we consider a different model of computation in which stacks and queues are primitive objects admitting to a certain number of unit cost operations and having no discernible internal structure.
Stack and Queue Layouts of Halin Graphs
 UNPUBLISHED
, 1995
"... A Halin graph the union of a tree with no degree2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues. A kstack (kqueue) layout of a graph consists of a linear ordering of the vertices along with an assignment of each ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
A Halin graph the union of a tree with no degree2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues. A kstack (kqueue) layout of a graph consists of a linear ordering of the vertices along with an assignment of each
Queues, Stacks, and Transcendentality at the Transition to Chaos
, 1998
"... Abstract. We examine the onehumped map at the perioddoubling transition to chaos, and ask whether its longterm memory is stacklike (lastin, firstout) or queuelike (firstin, firstout). We show that it can be recognized by a realtime automaton with one queue, or two stacks, and give several ..."
Abstract
 Add to MetaCart
Abstract. We examine the onehumped map at the perioddoubling transition to chaos, and ask whether its longterm memory is stacklike (lastin, firstout) or queuelike (firstin, firstout). We show that it can be recognized by a realtime automaton with one queue, or two stacks, and give several
Stack And Queue Layouts Of Directed Acyclic Graphs: Part I
, 1996
"... . Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
stack layout (queue layout). In this paper, bounds are established on the stacknumber and queuenumber of two classes of dags: tree dags and unicyclic dags. In particular, any tree dag can be laid out in 1 stack and in at most 2 queues; and any unicyclic dag can be laid out in at most 2 stacks
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
, 2005
"... A kstack layout (respectively, kqueue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of noncrossing (nonnested) edges with respect to the vertex ordering. A ktrack layout of a graph consists of a vertex kcolouring, and a total order of ea ..."
Abstract
 Add to MetaCart
of whether queuenumber is bounded by stacknumber to whether 3stack graphs have bounded queue number. It is proved that every graph has a 2queue subdivision, a 4track subdivision, and a mixed 1stack 1queue subdivision. All these values are optimal for every nonplanar graph. In addition, we
On the Queue Number of Planar Graphs
, 2010
"... We prove that planar graphs have O(log 4 n) queue number, thus improving upon the previous O ( √ n) upper bound. Consequently, planar graphs admit 3D straightline crossingfree grid drawings in O(n log c n) volume, for some constant c, thus improving upon the previous O(n 3/2) upper bound. 2 1 ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We prove that planar graphs have O(log 4 n) queue number, thus improving upon the previous O ( √ n) upper bound. Consequently, planar graphs admit 3D straightline crossingfree grid drawings in O(n log c n) volume, for some constant c, thus improving upon the previous O(n 3/2) upper bound. 2 1
M.: Sorting using networks of stacks and queues
 ESA 2008. LNCS
, 2008
"... We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to n is delivered and an output node where they are expected in sorted order. How many ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to n is delivered and an output node where they are expected in sorted order. How
A new encoding for labeled trees employing a stack and a queue
 Bulletin of the Institute of Combinatorics and its Applications
, 2002
"... A novel algorithm for encoding finite labeled trees is proposed in this paper. The algorithm establishes a onetoone mapping between trees of order n and (n – 2)tuples of the node labels. This encoding is similar to those proposed by Prüfer [8] and Neville [6], except that our encoding scheme has ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
A novel algorithm for encoding finite labeled trees is proposed in this paper. The algorithm establishes a onetoone mapping between trees of order n and (n – 2)tuples of the node labels. This encoding is similar to those proposed by Prüfer [8] and Neville [6], except that our encoding scheme has
StackBased Genetic Programming
, 1994
"... Some recent work in the field of Genetic Programming (GP) has been concerned with finding optimum representations for evolvable and efficient computer programs. In this paper, I describe a new GP system in which target programs run on a stackbased virtual machine. The system is shown to have certai ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
Some recent work in the field of Genetic Programming (GP) has been concerned with finding optimum representations for evolvable and efficient computer programs. In this paper, I describe a new GP system in which target programs run on a stackbased virtual machine. The system is shown to have
Stack And Queue Layouts Of Directed Acyclic Graphs (Extended Abstract)
 1992 DIMACS WORKSHOP ON PLANAR GRAPHS: STRUCTURE AND ALGORITHMS
, 1993
"... Stack layouts and queue layouts of undirected graphs are used to model problems in fault tolerant computing, in VLSI design, and in managing the flow of data in a parallel processing system. In certain applications, such as managing the flow of data in a parallel processing system, it is more real ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, then no two arcs that are assigned to the same stack cross. A queue layout is defined similarly, except that arcs are assigned to queues with the condition that no two arcs assigned to a queue nest. The stacknumber of a dag is the smallest number of stacks required for its stack layout, while the queuenumber
Results 1  10
of
26,450