Menu

Filtros : "IME" "FERNANDES, CRISTINA GOMES" "2003" Removidos: "2019" "Song, Siang Wun" "Financiado pela European Commission" Limpar

Filtros

Refine with date range

  • 1

1 - 4 (4 records)

  • Trabalho de evento

    Primal-dual algorithms for QoS multimedia multicast (2003)

    Calinescu, George; Fernandes, Cristina Gomes ; Mandoiu, Ion ; Olshevsky, Alex ; Yang, K; Zelikovsky, Alexander

    Source: Proceedings. Conference titles: IEEE Global Telecommunications Conference - GLOBECOM. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS

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

    • ABNT

      CALINESCU, George et al. Primal-dual algorithms for QoS multimedia multicast. 2003, Anais.. Piscataway: IEEE, 2003. Disponível em: https://doi.org/10.1109/GLOCOM.2003.1258911. Acesso em: 04 jul. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., Mandoiu, I., Olshevsky, A., Yang, K., & Zelikovsky, A. (2003). Primal-dual algorithms for QoS multimedia multicast. In Proceedings. Piscataway: IEEE. doi:10.1109/GLOCOM.2003.1258911

    • NLM

      Calinescu G, Fernandes CG, Mandoiu I, Olshevsky A, Yang K, Zelikovsky A. Primal-dual algorithms for QoS multimedia multicast [Internet]. Proceedings. 2003 ;[citado 2024 jul. 04 ] Available from: https://doi.org/10.1109/GLOCOM.2003.1258911

    • Vancouver

      Calinescu G, Fernandes CG, Mandoiu I, Olshevsky A, Yang K, Zelikovsky A. Primal-dual algorithms for QoS multimedia multicast [Internet]. Proceedings. 2003 ;[citado 2024 jul. 04 ] Available from: https://doi.org/10.1109/GLOCOM.2003.1258911

  • Artigo de periodico

    A new approximation algorithm for finding heavy planar subgraphs (2003)

    Calinescu, Gruia; Fernandes, Cristina Gomes ; Karloff, Howard; Zelikovsky, Alexander

    Source: Algorithmica. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      CALINESCU, Gruia et al. A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, v. 36, n. 2, p. 179-205, 2003Tradução . . Disponível em: https://doi.org/10.1007/s00453-002-1020-3. Acesso em: 04 jul. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., Karloff, H., & Zelikovsky, A. (2003). A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, 36( 2), 179-205. doi:10.1007/s00453-002-1020-3

    • NLM

      Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 jul. 04 ] Available from: https://doi.org/10.1007/s00453-002-1020-3

    • Vancouver

      Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 jul. 04 ] Available from: https://doi.org/10.1007/s00453-002-1020-3

  • Artigo de periodico

    Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)

    Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.

    Source: Journal of Algorithms. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 04 jul. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7

    • NLM

      Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 jul. 04 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7

    • Vancouver

      Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 jul. 04 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7

  • Relatorio tecnico

    From monomials to words to graphs (2003)

    Fernandes, Cristina Gomes ; Green, Edward L; Mandel, Arnaldo

    Unidade: IME

    Assunto: SEMIGRUPOS (COMBINATÓRIA)

    Versão PublicadaHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes e GREEN, Edward L e MANDEL, Arnaldo. From monomials to words to graphs. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/ed8dd273-1c35-44f6-80b0-d307639b5d06/1306948.pdf. Acesso em: 04 jul. 2024. , 2003

    • APA

      Fernandes, C. G., Green, E. L., & Mandel, A. (2003). From monomials to words to graphs. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/ed8dd273-1c35-44f6-80b0-d307639b5d06/1306948.pdf

    • NLM

      Fernandes CG, Green EL, Mandel A. From monomials to words to graphs [Internet]. 2003 ;[citado 2024 jul. 04 ] Available from: https://repositorio.usp.br/directbitstream/ed8dd273-1c35-44f6-80b0-d307639b5d06/1306948.pdf

    • Vancouver

      Fernandes CG, Green EL, Mandel A. From monomials to words to graphs [Internet]. 2003 ;[citado 2024 jul. 04 ] Available from: https://repositorio.usp.br/directbitstream/ed8dd273-1c35-44f6-80b0-d307639b5d06/1306948.pdf
  • 1

1 - 4 (4 records)

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