Two Cycle-Related Problems of Regular Data Flow Graphs: Complexity and Heuristics

P.K. Murthy and Edward A. Lee

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M97/76

1997

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/Archive/ERL-97-76.pdf

BibTeX citation:

@techreport{Murthy:M97/76,
    Author= {Murthy, P.K. and Lee, Edward A.},
    Title= {Two Cycle-Related Problems of Regular Data Flow Graphs: Complexity and Heuristics},
    Year= {1997},
    Month= {Oct},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/3316.html},
    Number= {UCB/ERL M97/76},
}

EndNote citation:

%0 Report
%A Murthy, P.K. 
%A Lee, Edward A. 
%T Two Cycle-Related Problems of Regular Data Flow Graphs: Complexity and Heuristics
%I EECS Department, University of California, Berkeley
%D 1997
%@ UCB/ERL M97/76
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/3316.html
%F Murthy:M97/76