Graph theoretic approach for pla area optimization (1991)
- Authors:
- USP affiliated authors: SONG, SIANG WUN - IME ; FERREIRA, AFONSO GALVAO - IME
- Unidade: IME
- Assunto: COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Workshop on Applications of Combinatorial Optimization in Science and Technology
-
ABNT
FERREIRA, Afonso Galvão e SONG, Siang Wun. Graph theoretic approach for pla area optimization. 1991, Anais.. Lyon: Instituto de Matemática e Estatística, Universidade de São Paulo, 1991. Disponível em: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf. Acesso em: 07 nov. 2024. -
APA
Ferreira, A. G., & Song, S. W. (1991). Graph theoretic approach for pla area optimization. In Proceedings. Lyon: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf -
NLM
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization [Internet]. Proceedings. 1991 ;[citado 2024 nov. 07 ] Available from: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf -
Vancouver
Ferreira AG, Song SW. Graph theoretic approach for pla area optimization [Internet]. Proceedings. 1991 ;[citado 2024 nov. 07 ] Available from: https://repositorio.usp.br/directbitstream/1fd4de11-d7ba-481e-8311-5e5bd0c2b2ba/813468.pdf - Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach
- Achieving optimality for gate matrix layout and pla folding: a graph theoretical approach
- Comunicacao em hipergrades e hipertoros usando barramentos
- Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach
- Efficient parallel graph algoritms for coarse-grained multicomputers and BSP
- Broadcasting in bus interconnection networks
- Generating permutations on a VLSI suitable linear network
- Bus based parallel computers: a viable way for massive parallelism
- 2-list algorithm for the knapsack problem on a fpst20
- Parallel time / hardware tradloff t.H =0(2 pot.N/2) for the knapsack problem
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 813468.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
