A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

DOI10.1007/BF02574809zbMath0856.90080OpenAlexW2066167753MaRDI QIDQ1924444

Yanyan Li

Publication date: 22 October 1996

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02574809

zbMATH Keywords

maximal cliquesknapsack constraintsnondominated covers

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Related Items (1)

On identifying dominant cliques.

Cites Work

• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

This page was built for publication: A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates