İçeriğe geç
akaturk Akademik ölçüm
Giriş Kayıt

OpenAlex konusu

Advanced Graph Theory Research

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 682 eser 49 yazar konusu

Çalışmalar

682 eser

  1. The effects of physical performance levels on sport participation motivation in master athletes 2011
    YÖKSİS SJR Q3

    Özet henüz yok.

  2. Can the Organizational Intelligence Be Developed in Schools by Inservice Trainining?(Giresun Mustafa Kemal Primary School Case) 2008
    YÖKSİS SJR Q3

    Özet henüz yok.

  3. Examining The Depressive Symptoms of 12 15 year old Turkish Adolescents According to Play Variable 2011
    YÖKSİS SJR Q3

    Özet henüz yok.

  4. A research about the perception levels of their bodies of female athletes and gender roles 2011
    YÖKSİS SJR Q3

    Özet henüz yok.

  5. Minimum-weight spanning tree algorithms A survey and empirical study 2001
    OpenAlex 79.2%

    Özet henüz yok.

  6. Approximating the single-sink link-installation problem in network design 2001
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 98.2%

    We initiate the algorithmic study of an important but NP-hard problem that arises commonly in network design. The input consists of the following: An undirected graph with one sink node and multiple source nodes, a specified length for each edge, and a specified demand, dem v , for each source node v. A small set of c…

  7. Design implementation and analysis of maximum transversal algorithms 2011
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.6%

    We report on careful implementations of seven algorithms for solving the problem of finding a maximum transversal of a sparse matrix. We analyze the algorithms and discuss the design choices. To the best of our knowledge, this is the most comprehensive comparison of maximum transversal algorithms based on augmenting p…

  8. Incremental assignment problem 2007
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.7%

    Özet henüz yok.

  9. Incremental assignment problem 2007
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.7%

    Özet henüz yok.

  10. Incremental assignment problem 2007
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.7%

    Özet henüz yok.

  11. Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design 1999
    OpenAlex 76.7%

    Özet henüz yok.

  12. ON SUBORBITAL GRAPHS FOR THE MODULAR GROUP 2001
    OpenAlex 13.8%

    This paper proves a conjecture of G. A. Jones, D. Singerman and K. Wicks, that a suborbital graph for the modular group is a forest if and only if it contains no triangles.

Akademisyenler

49 akademisyen