Abstract
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.2570n) and polynomial space.KeywordsMaximum DegreeRecursive CallInternal VertexPrimal GraphSparse GraphThese 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.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call