完整後設資料紀錄
DC 欄位語言
dc.contributor.authorJou, MJen_US
dc.contributor.authorChang, GJen_US
dc.date.accessioned2014-12-08T15:41:54Z-
dc.date.available2014-12-08T15:41:54Z-
dc.date.issued2002-10-01en_US
dc.identifier.issn0381-7032en_US
dc.identifier.urihttp://hdl.handle.net/11536/28497-
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.titleAlgorithmic aspects of counting independent setsen_US
dc.typeArticleen_US
dc.identifier.journalARS COMBINATORIAen_US
dc.citation.volume65en_US
dc.citation.issueen_US
dc.citation.spage265en_US
dc.citation.epage277en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000179170900023-
dc.citation.woscount8-
顯示於類別:期刊論文