A node covering algorithm

DOI10.1002/NAV.3800240203MaRDI QIDQ4161101zbMATH OpenOpenAlexFDO

Authors E. Balas, Haakon M. Samuelsson

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

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Programming involving graphs or networks (90C35)

Cited in

(8)

• A fast algorithm for the maximum weight clique problem
• The maximum clique problem
• A multi-KP modeling for the maximum-clique problem
• Enumerating all connected maximal common subgraphs in two graphs
• Algorithm of determination of largest internally stable set of a graph
• A branch and bound algorithm for the maximum clique problem
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
• Finding maximum cliques in arbitrary and in special graphs

This page was built for publication: A node covering algorithm

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