Skip to content
akaturk Academic measurement
Sign in Sign up

OpenAlex topic

Advanced Graph Theory Research

This page lists works and academicians tagged with an OpenAlex topic. It is not a YÖKSİS primary or secondary field.

OpenAlex 849 works 49 author topics

Works

849 works

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

    No abstract yet.

  2. Approximating the single-sink link-installation problem in network design 2001
    YÖKSİS SJR Q1 JCR Q1 OpenAlex top 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…

  3. Design implementation and analysis of maximum transversal algorithms 2011
    YÖKSİS SJR Q1 JCR Q1 OpenAlex top 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…

  4. On 3 uniform hypergraphs without a cycle of a given length 2017
    YÖKSİS SJR Q2 JCR Q3 OpenAlex top 1% OpenAlex 99.6%

    No abstract yet.

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

    No abstract yet.

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

    No abstract yet.

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

    No abstract yet.

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

    No abstract yet.

  9. 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.

  10. Anti Ramsey number of matchings in hypergraphs 2013
    YÖKSİS SJR Q1 JCR Q3 OpenAlex 78.4%

    No abstract yet.

  11. On approximating planar metrics by tree metrics 2001
    YÖKSİS SJR Q2 JCR Q4 OpenAlex top 10% OpenAlex 94.7%

    No abstract yet.

  12. On domination in connected cubic graphs 2005
    YÖKSİS SJR Q2 JCR Q3 OpenAlex top 10% OpenAlex 90.1%

    No abstract yet.

Academicians

49 academicians