Answers are grounded in this paper and cite their sources.
In this paper we examine some of the mathematical properties of Everett's graph theoretic blocking procedures. In particular we discuss how k‐plexes are blocked by Everett's algorithm. We also give a mathematical definition and algorithm for finding a class of actors identified as important in Everett's paper.
No takes yet. Share an insight, caveat, or question.
Martin G. Everett (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: