Loading...
Please wait, while we are loading the content...
Similar Documents
Algorithms for generating all the maximal independent sets of some graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Jou, Min-Jen Lin, Jenq-Jong |
| Copyright Year | 2018 |
| Abstract | An independent set is a set of vertices in a graph, no two of which are adjacent. A maximal independent set is an independent set that is not a proper subset of any other independent set. Note that in general counting the number of maximal independent sets in a graph is NP-complete [5]. In this paper, we give two linear-time algorithms to characterize all the maximal independent sets of the path Pn and the cycle Cn. Mathematics Subject Classification: 05C69, 05C85 |
| Starting Page | 95 |
| Ending Page | 101 |
| Page Count | 7 |
| File Format | PDF HTM / HTML |
| DOI | 10.12988/ijcms.2018.826 |
| Alternate Webpage(s) | http://www.m-hikari.com/ijcms/ijcms-2018/1-4-2018/p/linIJCMS1-4-2018.pdf |
| Alternate Webpage(s) | https://doi.org/10.12988/ijcms.2018.826 |
| Volume Number | 13 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |