Talk:Essential complexity: Difference between revisions

Revision as of 02:06, 21 July 2014

Revision as of 02:08, 21 July 2014

Line 58:

== Prior work ==

I'm surprised that a journal published McCabe's paper (in 1976) without noticing that his section VI (about the irreducible graphs), minus the proposed measure, duplicated the [more extensive] findings of the compiler guys, published some 4 years before, namely ''CharacterizationsFlow of reducible flowgraph graphsreducibility'' by Hecht and Ullman, which appeared both at STOC'72 and also in SIAM J. of Comput. in the same year. Hecht and Ullman introduce there their "Collapsibility" which does what McCabe's reduction does. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 02:06, 21 July 2014 (UTC)