Maximal independent sets in a generalisation of caterpillar graph

K. S. Neethi and Sanjeev Saxena ()
Additional contact information
K. S. Neethi: Indian Institute of Technology
Sanjeev Saxena: Indian Institute of Technology

Journal of Combinatorial Optimization, 2017, vol. 33, issue 1, No 23, 326-332

Abstract: Abstract A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (Discret Appl Math 160(3): 259–266, 2012) describe an algorithm, linear in the size of the output, for finding the family of maximal independent sets in a caterpillar graph. In this paper, we propose an algorithm, again linear in the output size, for a generalised version of caterpillar graph, where at each vertex of the backbone, there can be any number of hairs of length one and at most one hair of length two.

Keywords: Maximal independent set; MIS; Caterpillar graphs; Generalised caterpillar graphs; Generating all MIS (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9960-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9960-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9960-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().