Algorithm for the vertex packing problem

DOI10.1007/BF01125139zbMath0875.68712OpenAlexW1985201355MaRDI QIDQ1816094

E. A. Sharkovskaya, Yu. V. Vojtishin

Publication date: 18 December 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

maximum internally stable set problemvertex packing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph

Cites Work

• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Algorithm for the vertex packing problem