Two Results on Layered Pathwidth and Linear Layouts

04/07/2020
by   Vida Dujmovic, et al.
0

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 at most four times the layered pathwidth of G. Our second result shows that any graph G with track number at most three has layered pathwidth at most four. The first result complements a result of Dujmović and Frati (2018) relating layered treewidth and stack number. The second result solves an open problem posed by Bannister et al (2015).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

Separating layered treewidth and row treewidth

Layered treewidth and row treewidth are recently introduced graph parame...
research
10/28/2017

Phase Conductor on Multi-layered Attentions for Machine Comprehension

Attention models have been intensively studied to improve NLP tasks such...
research
04/09/2019

Planar Graphs have Bounded Queue-Number

We show that planar graphs have bounded queue-number, thus proving a con...
research
06/26/2019

(Theta, triangle)-free and (even hole, K_4)-free graphs. Part 1 : Layered wheels

We present a construction called layered wheel. Layered wheels are graph...
research
08/01/2022

Proportional Fair Division of Multi-layered Cakes

We study the multi-layered cake cutting problem, where the multi-layered...
research
06/04/2021

Envy-free division of multi-layered cakes

We study the problem of dividing a multi-layered cake among heterogeneou...
research
02/07/2023

Layered State Discovery for Incremental Autonomous Exploration

We study the autonomous exploration (AX) problem proposed by Lim Aue...

Please sign up or login with your details

Forgot password? Click here to reset