A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A parallel algorithm for computing the critical independence number and related sets
2012
Ars Mathematica Contemporanea
An independent set I c is a critical independent set if |I c | − |N (I c )| ≥ |J| − |N (J)|, for any independent set J. The critical independence number of a graph is the cardinality of a maximum critical independent set. This number is a lower bound for the independence number and can be computed in polynomial-time. The existing algorithm runs in O(n 2.5 m/ log n) time for a graph G with n = |V (G)| vertices and m edges. It is demonstrated here that there is a parallel algorithm using n
doi:10.26493/1855-3974.165.b8b
fatcat:tzvoqqkbcnckzlaogb2wwqwhfu