On maximum internally stable sets of a graph

U. J. Nieminen

Naval Research Logistics Quarterly, 1974, vol. 21, issue 3, 557-561

Abstract: The paper makes some remarks on the paper of Hakimi and Frank and shows a simplified way of applying the concept of alternating forest. An algorithm for finding a maximum internally stable set of an undirected graph is constructed and some examples are given.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800210315

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:21:y:1974:i:3:p:557-561

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().