A parallel algorithm for computing the critical independence number and related sets

DOI10.26493/1855-3974.165.b8bzbMath1290.05115OpenAlexW1908129778WikidataQ129355046 ScholiaQ129355046MaRDI QIDQ5415703

Ermelinda DeLaViña, Craig E. Larson

Publication date: 14 May 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.165.b8b

zbMATH Keywords

independence numbermatching numberKönig-Egerváry graphcritical independence numbercritical independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Critical sets, crowns and local maximum independent sets ⋮ Critical and maximum independent sets of a graph

This page was built for publication: A parallel algorithm for computing the critical independence number and related sets