Filtros : "Financiamento CNPq/NSF" "Springer" Limpar

Filtros



Refine with date range


  • Source: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Unidade: IME

    Assunto: ALGORITMOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SONG, Siang Wun. Parallel graph algorithms for coarse-grained multicomputers. Models for parallel and distributed computation : theory, algorithmic techniques and applications. Tradução . Boston: Springer, 2002. . Disponível em: https://doi.org/10.1007/978-1-4757-3609-0_6. Acesso em: 09 nov. 2025.
    • APA

      Song, S. W. (2002). Parallel graph algorithms for coarse-grained multicomputers. In Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer. doi:10.1007/978-1-4757-3609-0_6
    • NLM

      Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
    • Vancouver

      Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
  • Source: Proceedings. Conference titles: International Conference on Computational Science - ICCS. Unidade: IME

    Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A coarse-grained parallel algorithm for maximal cliques in circle graphs. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45718-6_69. Acesso em: 09 nov. 2025.
    • APA

      Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A coarse-grained parallel algorithm for maximal cliques in circle graphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45718-6_69
    • NLM

      Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
    • Vancouver

      Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/3-540-45718-6_69

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2025