Practical Aspects of the Graph Parameter Boolean-width
Doctoral thesis
View/
Date
2014-08-18Metadata
Show full item recordCollections
- Department of Informatics [1013]
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_18Paper 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.