> Details

Dvořák, Zdeněk [Author]; Gonçalves, Daniel [Author]; Lahiri, Abhiruk [Author]; Tan, Jane [Author]; Ueckerdt, Torsten [Author] ; Zdeněk Dvořák and Daniel Gonçalves and Abhiruk Lahiri and Jane Tan and Torsten Ueckerdt [Contributor]

On Comparable Box Dimension

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: On Comparable Box Dimension
  • Contributor: Dvořák, Zdeněk [Author]; Gonçalves, Daniel [Author]; Lahiri, Abhiruk [Author]; Tan, Jane [Author]; Ueckerdt, Torsten [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.SoCG.2022.38
  • Keywords: treewidth fragility ; minor-closed graph classes ; geometric graphs
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access