Generating all maximal independent sets on trees in lexicographic order
type: Item
instance of: scholarly article
title: Generating all maximal independent sets on trees in lexicographic order
zbMATH Open document ID: 0820.90112
DOI: 10.1016/0020-0255(94)90013-2
author: V. Pereyra
published in: Information Sciences
publication date: 1995-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 611276
zbMATH Keywords: maximal independent sets
zbMATH Keywords: lexicographic order
zbMATH Keywords: polynomial time delay
zbMATH Keywords: NP- complete
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: 0020-0255(94)90013-2
OpenAlex ID: W2154008162
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Q4770975
cites work: Independent domination in chordal graphs
cites work: Q4198056
cites work: On generating all maximal independent sets
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
cites work: A New Algorithm for Generating All the Maximal Independent Sets
description: scientific article; zbMATH DE number 611276