• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Practical Aspects of the Graph Parameter Boolean-width

Sharmin, Sadia
Doctoral thesis
Thumbnail
View/Open
Main thesis (759.0Kb)
URI
https://hdl.handle.net/1956/8406
Date
2014-08-18
Metadata
Show full item record
Collections
  • Department of Informatics [536]
Has parts
Paper I: Telle, Jan Arne; Vatshelle, Martin; Hvidevold, Eivind; Sharmin, Sadia. Finding good decompositions for dynamic programming on dense graphs. Lecture Notes in Computer Science 2012 ;Volum 7112. s. 219-231. Full text not available in BORA due to publisher restrictions. The article is available at: http://dx.doi.org/10.1007/978-3-642-28050-4_18

Paper II: Manne, Fredrik; Sharmin, Sadia. Efficient counting of maximal independent sets in sparse graphs. Lecture Notes in Computer Science 2013 ;Volum 7933. s. 103-114. Full text not available in BORA due to publisher restrictions. The article is available at: http://dx.doi.org/10.1007/978-3-642-38527-8_11.
Publisher
The University of Bergen
Copyright
Copyright the author. All rights reserved

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit