Title: | Algorithmic aspects of counting independent sets |
Authors: | Jou, MJ Chang, GJ 應用數學系 Department of Applied Mathematics |
Issue Date: | 1-Oct-2002 |
Abstract: | This paper studied the problems of counting independent sets, maximal independent sets, and maximum independent sets of a graph from an algorithmic point of view. In particular, we present linear-time algorithms for these problems in trees and unicyclic graphs. |
URI: | http://hdl.handle.net/11536/28497 |
ISSN: | 0381-7032 |
Journal: | ARS COMBINATORIA |
Volume: | 65 |
Issue: | |
Begin Page: | 265 |
End Page: | 277 |
Appears in Collections: | Articles |