Algorithmic aspects of counting independent sets

dc.citation.epage	277	en_US
dc.citation.issue		en_US
dc.citation.spage	265	en_US
dc.citation.volume	65	en_US
dc.citation.woscount	8
dc.contributor.author	Jou, MJ	en_US
dc.contributor.author	Chang, GJ	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:41:54Z
dc.date.available	2014-12-08T15:41:54Z
dc.date.issued	2002-10-01	en_US
dc.description.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.	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/28497
dc.identifier.wosnumber	WOS:000179170900023
dc.language.iso	en_US	en_US
dc.title	Algorithmic aspects of counting independent sets	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1