Results 1 to 10 of about 108,706 (192)

Track Layouts of Graphs [PDF]

open access: yesDiscrete 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   +9 more sources

Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
A k-stack layout (respectively, k-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   +4 more sources

Optimal Stack Layout in a Sea Container Terminal with Automated Lifting Vehicles [PDF]

open access: yesInternational Journal of Production Research, 2014
Container terminal performance is largely determined by its design decisions, which include the number and type of quay cranes (QCs), stack cranes (SCs), transport vehicles, vehicle travel path, and stack layout.
Gupta, A. (Akash)   +3 more
core   +4 more sources

Multi-Frequency Vibration Suppression Based on an Inertial Piezoelectric Actuator Applied in Indoor Substations [PDF]

open access: yesMicromachines
This paper addresses the suppression of multi-frequency line spectrum vibrations during the operation of indoor substations through the development of an active vibration isolation scheme based on a piezoelectric stack inertial actuator.
Xiaohan Li   +5 more
doaj   +2 more sources

Stack and Queue Layouts of Posets [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 1997
Summary: The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph.
Heath, Lenwood S., Pemmaraju, Sriram V.
openaire   +4 more sources

Compiler-supported Program Stack Space Layout Runtime Randomization Method [PDF]

open access: yesJisuanji kexue, 2023
Multi-variant execution is one of the most popular active defense technologies.MVX identifies attack behavior by running a set of functionally equivalent heterogeneous variants parallelly and detecting inconsistent state transitions between different ...
ZHU Pengzhe, YAO Yuan, LIU Zijing, XI Ruicheng
doaj   +1 more source

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 crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj   +2 more sources

Improving the functionality, 5S rating, and inventory management system of the supply department of a regimental academy in the Philippines through industrial engineering applications [PDF]

open access: yesInternational Research Journal of Science, Technology, Education, and Management, 2023
The Philippine Military Academy's (PMA) Cadet Mess Supply Room is the institution's essential area for storing and dispatching tableware on a daily basis, as well as during conferences, functions, and events on the premises.
Geraldine G. Nerona   +10 more
doaj   +1 more source

Steady-State and Transient Operation of Solid Oxide Fuel Cell Systems with Anode Off-Gas Recirculation within a Highly Constrained Operating Range

open access: yesEnergies, 2023
Based on a prototype presented in a prior publication, this research investigates the operational characteristics of a methane-fueled solid oxide fuel cell (SOFC) system with anode off-gas recirculation (AOGR) for electrical energy supply on sea-going ...
Jan Hollmann, Stephan Kabelac
doaj   +1 more source

Stack and Queue Layouts via Layered Separators [PDF]

open access: yesJournal of Graph Algorithms and Applications, 2016
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors.
Dujmović, Vida, Frati, Fabrizio
openaire   +4 more sources

Home - About - Disclaimer - Privacy