Logo image
Se connecter
On Comparable Box Dimension
Acte de colloque

On Comparable Box Dimension

Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan et Torsten Ueckerdt
Leibniz International Proceedings in Informatics (LIPIcs), Vol.224, pp.38:1--38:14
Leibniz International Proceedings in Informatics (LIPIcs)
SoCG 2022 - 38th International Symposium on Computational Geometry (Berlin, Germany, 07/06/2022–10/06/2022)
01/06/2022

Résumé

Geometric graphs Minor-closed graph classes Treewidth fragility
Two boxes in ℝ^d are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph G is the minimum integer d such that G can be represented as a touching graph of comparable axis-aligned boxes in ℝ^d. We show that proper minor-closed classes have bounded comparable box dimension and explore further properties of this notion.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image