標題: | Algorithmic aspects of counting independent sets |
作者: | Jou, MJ Chang, GJ 應用數學系 Department of Applied Mathematics |
公開日期: | 1-十月-2002 |
摘要: | 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 |
期刊: | ARS COMBINATORIA |
Volume: | 65 |
Issue: | |
起始頁: | 265 |
結束頁: | 277 |
顯示於類別: | 期刊論文 |