Linear Layouts of Complete Graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10439087" target="_blank" >RIV/00216208:11320/21:10439087 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-92931-2_19" target="_blank" >https://doi.org/10.1007/978-3-030-92931-2_19</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-92931-2_19" target="_blank" >10.1007/978-3-030-92931-2_19</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Linear Layouts of Complete Graphs

Popis výsledku v původním jazyce

A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an abab-pattern (abba-pattern). A union page (union queue) is a vertex-disjoint union of pages (queues). The union page number (union queue number) of a graph is the smallest k such that there is a vertex ordering and a partition of the edges into k union pages (union queues). The local page number (local queue number) is the smallest k for which there is a vertex ordering and a partition of the edges into pages (queues) such that each vertex has incident edges in at most k pages (queues). We present upper and lower bounds on these four parameters for the complete graph Kn on n vertices. In three cases we obtain the exact result up to an additive constant. In particular, the local page number of Kn is n/ 3 +- O(1 ), while its local and union queue number is (1-1/2)n+-O(1). The union page number of Kn is between n/ 3 - O(1 ) and 4 n/ 9 + O(1 ). (C) 2021, Springer Nature Switzerland AG.

Název v anglickém jazyce

Linear Layouts of Complete Graphs

Popis výsledku anglicky

A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an abab-pattern (abba-pattern). A union page (union queue) is a vertex-disjoint union of pages (queues). The union page number (union queue number) of a graph is the smallest k such that there is a vertex ordering and a partition of the edges into k union pages (union queues). The local page number (local queue number) is the smallest k for which there is a vertex ordering and a partition of the edges into pages (queues) such that each vertex has incident edges in at most k pages (queues). We present upper and lower bounds on these four parameters for the complete graph Kn on n vertices. In three cases we obtain the exact result up to an additive constant. In particular, the local page number of Kn is n/ 3 +- O(1 ), while its local and union queue number is (1-1/2)n+-O(1). The union page number of Kn is between n/ 3 - O(1 ) and 4 n/ 9 + O(1 ). (C) 2021, Springer Nature Switzerland AG.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Graph Drawing and Network Visualization

ISBN

978-3-030-92930-5

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

14

Strana od-do

257-270

Název nakladatele

Springer Science and Business Media Deutschland GmbH

Místo vydání

Neuveden

Místo konání akce

Tuebingen

Datum konání akce

14. 9. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—