Menu

Filtros : "Calinescu, Gruia" "1998" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    A better approximation algorithm for finding planar subgraphs (1998)

    Calinescu, Gruia; Fernandes, Cristina Gomes ; Finkler, Ulrich; Karloff, Howard

    Source: Journal of Algorithms. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS GRÁFICOS

    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 better approximation algorithm for finding planar subgraphs. Journal of Algorithms, v. 27, n. 2, p. 269-302, 1998Tradução . . Disponível em: https://doi.org/10.1006/jagm.1997.0920. Acesso em: 17 out. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1998). A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, 27( 2), 269-302. doi:10.1006/jagm.1997.0920

    • NLM

      Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 out. 17 ] Available from: https://doi.org/10.1006/jagm.1997.0920

    • Vancouver

      Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 out. 17 ] Available from: https://doi.org/10.1006/jagm.1997.0920

  • Trabalho de evento

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

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

    Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. 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, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 17 out. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11

    • NLM

      Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

    • Vancouver

      Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
  • 1

1 - 2 (2 records)

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