A new linear time algorithm to construct dominator trees of reducible flow graphs (2012)
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
ABNT
FRANCO, Álvaro e FERREIRA, Carlos Eduardo. A new linear time algorithm to construct dominator trees of reducible flow graphs. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 24 jan. 2026.APA
Franco, Á., & Ferreira, C. E. (2012). A new linear time algorithm to construct dominator trees of reducible flow graphs. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdfNLM
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2026 jan. 24 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdfVancouver
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2026 jan. 24 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
