A node covering algorithm
From MaRDI portal
Publication:4161101
DOI10.1002/nav.3800240203zbMath0381.90093OpenAlexW2048053250MaRDI QIDQ4161101
Haakon M. Samuelsson, Egon Balas
Publication date: 1977
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800240203
Programming involving graphs or networks (90C35) Combinatorial aspects of packing and covering (05B40)
Related Items
A multi-KP modeling for the maximum-clique problem, A branch and bound algorithm for the maximum clique problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Enumerating all connected maximal common subgraphs in two graphs, Algorithm of determination of largest internally stable set of a graph, Finding maximum cliques in arbitrary and in special graphs, A fast algorithm for the maximum weight clique problem, The maximum clique problem
