• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Master theses
  • Vis innførsel
  •   Hjem
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Master theses
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

On the Linear MIM-width of Trees

Høgemo, Svein
Master thesis
Thumbnail
Åpne
master thesis (1.309Mb)
Permanent lenke
https://hdl.handle.net/1956/20432
Utgivelsesdato
2019-06-26
Metadata
Vis full innførsel
Samlinger
  • Master theses [85]
Sammendrag
Linear MIM-width, and its generalization MIM-width, is a graph width parameter that has become noted for having bounded value on several important graph classes, e.g. interval graphs and permutation graphs. The linear MIM-width of a graph G measures a min-max relation on all maximum induced matchings in bipartite graphs given by a linear layout of the vertices in G, over all possible linear layouts. In this thesis we give an overlook of some of the research that has been done on this parameter, and provide a new result, computing the linear MIM-width of trees in n log n time.
Utgiver
The University of Bergen
Opphavsrett
Copyright the Author. All rights reserved

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit