Complexity of Edge Editing to a Connected Graph of Bounded Degrees
dc.contributor.author | Haarberg, Øyvind Stette | |
dc.date.accessioned | 2019-06-26T00:32:31Z | |
dc.date.available | 2019-06-26T00:32:31Z | |
dc.date.issued | 2019-06-26 | |
dc.date.submitted | 2019-06-25T22:00:11Z | |
dc.identifier.uri | https://hdl.handle.net/1956/20431 | |
dc.language.iso | eng | |
dc.publisher | The University of Bergen | en_US |
dc.title | Complexity of Edge Editing to a Connected Graph of Bounded Degrees | |
dc.type | Master thesis | |
dc.date.updated | 2019-06-25T22:00:11Z | |
dc.rights.holder | Copyright the Author. All rights reserved | en_US |
dc.description.degree | Masteroppgave i informatikk | en_US |
dc.description.localcode | INF399 | |
dc.description.localcode | MAMN-PROG | |
dc.description.localcode | MAMN-INF | |
dc.subject.nus | 754199 | |
fs.subjectcode | INF399 | |
fs.unitcode | 12-12-0 |
Tilhørende fil(er)
Denne innførselen finnes i følgende samling(er)
-
Master theses [217]