Content deleted Content added
→Prior work: sorry the other/earlier paper of theirs on this |
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Tag: |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 1:
{{WikiProject banner shell|
{{WikiProject Computing}}
}}
== 2007-02-1 Automated pywikipediabot message ==
Line 58 ⟶ 59:
== 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 ''Flow graph reducibility'' by Hecht and Ullman, which appeared both at STOC'72 and also in SIAM J. of Comput. in the same year ({{doi|10.1145/800152.804919}} and {{doi|10.1137/0201014}}). 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)
| |||