Work

Lower Bounds on the mim-width of Some Graph Classes

Year: 2016

Type: preprint

Abstract: mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs, co-comparability graphs and circle graphs. This improves and refines lower bounds that were known before, some of them only conditionally. In the case of strongly chordal graphs not even a conditional lower bound was known before. All of the bounds given are optimal up to constants.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1608.01542

Author: Mengel, Stefan

Institutions: Centre National de la Recherche Scientifique, Centre de Recherche en Informatique de Lens

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950284389

Cites: 11

Cited by: 1

Related to: 20