Part of the Lecture Notes in Computer Science book series (LNCS, volume 7147)
Counting Maximal Independent Sets in Subcubic Graphs
The main result of this paper is an algorithm counting maximal independent sets in graphs with maximum degree at most 3 in time O *(1.2570 n ) and polynomial space.
KeywordsMaximum Degree Recursive Call Internal Vertex Primal Graph Sparse Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 11.Junosza-Szaniawski, K., Tuczyński, M.: Counting maximal independent sets in subcubic graphs, Tech Rep., www.mini.pw.edu.pl/~szaniaws
© Springer-Verlag Berlin Heidelberg 2012