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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 15, Issue 1; no. 1
Main Authors:	Ganian, Robert, Hliněný, Petr, Nešetřil, Jaroslav, Obdržálek, Jan, de Mendez, Patrice Ossona
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 01.01.2019 Logical Methods in Computer Science e.V
Subjects:	03b70, 05c75, 68r10 Combinatorics computer science - discrete mathematics computer science - logic in computer science Mathematics mathematics - combinatorics
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!