An Algorithm for the Vertex Packing Problem
From MaRDI portal
Publication:4162990
DOI10.1287/opre.25.5.773zbMath0383.90101OpenAlexW2023633643MaRDI QIDQ4162990
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of graph theory to circuits and networks (94C15) Combinatorial aspects of packing and covering (05B40)
Related Items (4)
Packing problems, dimensions and the tensor product of complete lattices ⋮ Optimization problems on posets with regard to formal concept analysis ⋮ Algorithm of determination of largest internally stable set of a graph ⋮ The maximum clique problem
This page was built for publication: An Algorithm for the Vertex Packing Problem