Results 1 to 10 of about 604,495 (140)

Improved Bounds for Track Numbers of Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2020
A track layout of a graph consists of a vertex coloring and a total order of each color class, such that no two edges cross between any two color classes.
Sergey Pupyrev
doaj   +4 more sources

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   +3 more sources

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

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

Two Results on Layered Pathwidth and Linear Layouts

open access: yesJournal of Graph Algorithms and Applications, 2021
Layered pathwidth is a new graph parameter studied by Bannister et al. (2015). In this paper we present two new results relating layered pathwidth to two types of linear layouts. Our first result shows that, for any graph $G$, the stack number of $G$ is
Vida Dujmović, Pat Morin, Céline Yelle
doaj   +1 more source

Updating the criteria for assessing the state of the railway track according to the data of track measuring equipment

open access: yesВестник Научно-исследовательского института железнодорожного транспорта, 2022
Introduction. One of the consequences of the introduction of the Instructions for Assessing the Condition of the Rail Track (enacted on February 28, 2020 No.
B. N. Zenzinov   +2 more
doaj   +1 more source

Real time segmentation method for underground track area based on improved STDC

open access: yesGong-kuang zidonghua, 2023
Currently, most underground rail transportation scenarios in China are relatively open. There are problems of operators, scattered materials, or coal slag invading the track. It poses a threat to locomotive operation.
MA Tian   +4 more
doaj   +1 more source

The determination of the repairs of railway track considering the reliability and risk level [PDF]

open access: yesE3S Web of Conferences, 2020
The method of predictive calculations of the state of the rails as the main element of assessing the state of the track when planning major repairs of the track is given.
Kovalenko Nikolai   +2 more
doaj   +1 more source

Methodology of Interoperating Link-K Track Number in Multi TDLs [PDF]

open access: yesThe Journal of Korean Institute of Communications and Information Sciences, 2013
In modern warfare, the main factor of triumph is superior situation awareness which leads rapid command decision and precisely guided munition, and TDL(Tactical Data Link) is the main communicational enabler. ROK forces currently operate Link-16 with allied forces and are also developing Korean national data link, Link-K which is also planned to be ...
Youn-Jeong Lee   +2 more
openaire   +1 more source

Implementation of track clustering based on ST DBSCAN

open access: yesDianzi Jishu Yingyong, 2022
Aiming at the shortcomings of existing track clustering algorithms for flying targets, a clustering method for track data in space-time domain is proposed, which can cluster tracks of arbitrary shape without dividing the number of clustering targets in ...
Zhu Yuliang
doaj   +1 more source

An examination of job opportunities, candidates, and salaries in the field of entrepreneurship [PDF]

open access: yesNew England Journal of Entrepreneurship, 2016
This article examines whether the field of entrepreneurship is becoming increasingly institutionalized by examining market trends, AACSB jobs, and salaries.
Todd A. Finkle
doaj   +1 more source

Home - About - Disclaimer - Privacy