The max quasi-independent set Problem

DOI10.1007/978-3-642-13182-0_6MaRDI QIDQ3569731zbMATH OpenOpenAlexFDO

Authors Nicolas Bourgeois, G. Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié, A. Giannakos

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://basepub.dauphine.fr/handle/123456789/5027

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The \textsc{max quasi-independent set} problem
• On the maximum number of maximum independent sets
• On characterization of maximal independent sets via quadratic optimization
• Maximizing the number of independent sets of a fixed size
• scientific article; zbMATH DE number 637355
• The largest number of maximal independent sets in quasi-unicyclic graphs
• Maximum independent sets near the upper bound
• Using critical sets to solve the maximum independent set problem
• On the maximum independent set problem in graphs of bounded maximum degree
• scientific article; zbMATH DE number 2246590

Cited in

(4)

• LP-based dual bounds for the maximum quasi-clique problem
• Largest sparse subgraphs of random graphs
• scientific article; zbMATH DE number 1305522 (Why is no real title available?)
• The \textsc{max quasi-independent set} problem

This page was built for publication: The max quasi-independent set Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569731)