Shrub-depth: Capturing Height of Dense Graphs
The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable under graph complementation)? To this...
Main Authors: | Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek, Patrice Ossona de Mendez |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2019-01-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/3798/pdf |
Similar Items
-
FO Model Checking of Interval Graphs
by: Robert Ganian, et al.
Published: (2015-12-01) -
Tuza's Conjecture for Threshold Graphs
by: Marthe Bonamy, et al.
Published: (2022-08-01) -
Fusible numbers and Peano Arithmetic
by: Jeff Erickson, et al.
Published: (2022-07-01) -
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
by: Jakub Gajarsky, et al.
Published: (2015-04-01) -
Faster Existential FO Model Checking on Posets
by: Jakub Gajarský, et al.
Published: (2015-12-01)