Algorithm of determination of largest internally stable set of a graph

DOI10.1007/BF01074525MaRDI QIDQ3673483zbMATH OpenOpenAlexFDO

Authors S. N. Trushin

Publication date 1982

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01074525

zbMATH Keywords

sequential analysisbranch-and-boundlargest internally stable set of a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3714954 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A node covering algorithm
• An Algorithm for the Vertex Packing Problem
• Vertex packings: Structural properties and algorithms

This page was built for publication: Algorithm of determination of largest internally stable set of a graph

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