Talk:Interval (graph theory)

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Reducible flow graphs

Should Reducible flow graphs really redirect here, now that there's a stub on flow graph? Characterization of reducible flow graphs via intervals is only one of the several useful characterizations. See in particular the last paper I've added. Natural loops is a more common one for today's compilers imo (and also introduced first in most textbooks: Dragon book [of course], but also Muchnick's, Appel's), although I can get both from LLVM for example. Interval was first historically, but the year given here is wrong. 188.27.81.64 (talk) 03:06, 21 July 2014 (UTC)[reply]

Note: The relevant content of flow graph has been merged into rooted graph, see pre-merge version of "flow graph" and rooted graph#Flow graphs. – Tea2min (talk) 09:54, 3 January 2017 (UTC)[reply]