Algorithm of determination of largest internally stable set of a graph

DOI10.1007/BF01074525zbMATH Open0522.90062OpenAlexW2061858684MaRDI QIDQ3673483FDOQ3673483

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex packings: Structural properties and algorithms
• A node covering algorithm
• An Algorithm for the Vertex Packing Problem
• Title not available (Why is that?)

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)