A new linear time algorithm to construct dominator trees of reducible flow graphs (2012)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- Assunto: OTIMIZAÇÃO COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher: Mathematical Optimization Society
- Publisher place: Philadelphia
- Date published: 2012
- Source:
- Título: Book of abstracts
- Conference titles: International Symposium on Mathematical Programming (ISMP 2012)
-
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: 10 mar. 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.pdf -
NLM
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2026 mar. 10 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf -
Vancouver
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2026 mar. 10 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf - The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- Some formulations for the group Steiner tree problem
- Formulations and valid inequalities for the node capacitated graph partitioning problem
- Advances in bioinformatics and computational biology
- Discrete Applied Mathematics
- V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Some integer programs arising in the design of main frame computers
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
