An Algorithm for the Vertex Packing Problem

DOI10.1287/OPRE.25.5.773MaRDI QIDQ4162990zbMATH OpenOpenAlexFDO

Authors David J. jun. Houck, R. R. Vemuganti

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.5.773

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Cited in

(4)

• The maximum clique problem
• Optimization problems on posets with regard to formal concept analysis
• Packing problems, dimensions and the tensor product of complete lattices
• Algorithm of determination of largest internally stable set of a graph

This page was built for publication: An Algorithm for the Vertex Packing Problem

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