Menu

Filtros : "Calinescu, Gruia" "Journal of Algorithms" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • 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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7

  • 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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi.org/10.1006/jagm.1997.0920
  • 1

1 - 2 (2 records)

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