Counting and enumerating independent sets with applications to combinatorial optimization problems

DOI10.1007/s00186-019-00696-4zbMath1444.05068MaRDI QIDQ784784

Frank Gurski, Carolin Rehs

Publication date: 3 August 2020

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-019-00696-4

zbMATH Keywords

knapsack problem; independent sets; threshold graphs; multidimensional knapsack problem

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

90C27: Combinatorial optimization

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)