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: 04 nov. 2024. -
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 2024 nov. 04 ] 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 2024 nov. 04 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf - A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
- A dynamic programming algorithm for the tree mapping problem
- The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial]
- Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]
- Some formulations for the group Steiner tree problem
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
