Skip to content
akaturk Academic measurement

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 682 works 49 author topics

Works

682 works

  1. YÖKSİS SJR Q3

    No abstract yet.

  2. YÖKSİS SJR Q3

    No abstract yet.

  3. YÖKSİS SJR Q3

    No abstract yet.

  4. YÖKSİS SJR Q3

    No abstract yet.

  5. OpenAlex 79.2%

    No abstract yet.

  6. 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…

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

  8. YÖKSİS SJR Q1 JCR Q1 OpenAlex top 10% OpenAlex 95.7%

    No abstract yet.

  9. YÖKSİS SJR Q1 JCR Q1 OpenAlex top 10% OpenAlex 95.7%

    No abstract yet.

  10. YÖKSİS SJR Q1 JCR Q1 OpenAlex top 10% OpenAlex 95.7%

    No abstract yet.

  11. OpenAlex 76.7%

    No abstract yet.

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

Academicians

49 academicians