Maximal independent sets in a generalisation of caterpillar graph

DOI10.1007/s10878-015-9960-0zbMath1365.90229arXiv1502.04514OpenAlexW3102753258MaRDI QIDQ512892

Sanjeev Saxena, K. S. Neethi

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.04514

zbMATH Keywords

maximal independent setcaterpillar graphsgeneralised caterpillar graphsgenerating all MISMIS

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• The complexity of computing the permanent
• Maximal independent sets in caterpillar graphs
• The number of caterpillars
• A New Algorithm for Generating All the Maximal Independent Sets
• Graph Drawing

This page was built for publication: Maximal independent sets in a generalisation of caterpillar graph