Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Graph algorithms”

Graph Algorithms

1992

This chapter contains sections titled: Transitive Closure Shortest Paths Minimum Weight Spanning Tree Optimum Branchings Perfect Matching, Optimal Assignment, and Timetable Scheduling The Chinese Postman Problem Depth-First Search Biconnectivity and Strong Connectivity Reducibility of a Program Graph st-Numbering of a Graph Planarity Testing Further Reading Exercises

Cited by 1

Graph Algorithms

Antti Laaksonen · Undergraduate topics in computer science · 2024

Cited by 0

Graph Algorithms

Justin R Smith · 1993

Abstract Introduction. This section develops an algorithm for parsing precedence gram mars and the evaluation of an arithmetic expression in O(lg n) time. Although parts of this algorithm are somewhat similar to the doubling algorithms of the previous section, we put these algorithms in a separate section because of their complexity. They are interesting for a number of reasons.

Cited by 0

Graph Algorithms

Even, Shimon · CERN Document Server (European Organization for Nuclear Research) · 2011

This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language.

Cited by 0

Graph algorithms

Ricky Sun · Elsevier eBooks · 2024

Cited by 0

Graph Algorithms

Sebastian Bruch · 2024

Cited by 0

Graph Algorithms

J. Van Leeuwen · 1986

Cited by 0

Graph Algorithms

2025

This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs. Several highly cited articles are included, which investigate topics such as the maximum clique problem, the Dubins traveling salesman problem, and computing the eccentricity distribution of a graph.

Cited by 0Open access

graph algorithms

Yanbo Ye, Bo Wei, Lei Wen et al. · 2013

Cited by 0

Graph Algorithms

Shimon Even · Cambridge University Press eBooks · 2011

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

Cited by 209

Graph Algorithms

Stefan Bird · 1979

Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but do not indicate any specific aspects of the performance. In this paper we split the offline error metric into two component parts. We propose a new metric to measure convergence speed, and show how this, when combined with a population diversity metric, correlates strongly with the overall performance. We then use these metrics to analyse several optimisation algorithms, yielding new insight into both the test function and how the algorithms ’ characteristics can be improved.

Cited by 0

Graph Algorithms

Martin Mareš · Digital Repository (National Repository of Grey Literature) · 2008

Cited by 0

GRAPH ALGORITHMS

Khushbakov Sherzod, Khamraev Mansur, Bakhtiyorova Mokhiruy · Zenodo (CERN European Organization for Nuclear Research) · 2022

<em>Graphs are widely-used mathematical structures visualized by two basic components: nodes and edges. Graph algorithms are used to solve the problems of representing graphs as networks like airline flights, how the Internet is connected, or social network connectivity on Facebook. This article will introduce you to the tools you need to master important graph algorithms and the optimal search algorithm in Python.</em>

Cited by 0Open access

Graph Algorithms

William J. Dally · Kluwer international series in engineering and computer science · 1987

Cited by 0

Graph algorithms

Even, Shimon 1935-2004, Even, Guy · 2012

"Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search, and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity"--

Cited by 0

Graph algorithms

Alexander Shen · Birkhäuser Boston eBooks · 1997

This section is devoted to different versions of one problem. Suppose a country has n cities numbered 1.. n. For each pair of cities i and j, an integer a [i] [j] is given that is the cost of a (nonstop) plane ticket from i to j. We assume that flights exist between any two cities, and that a [k] [k] = 0 for any k. In general, a [i] [j] may be different from a [j] [i]. Our goal is to find the minimal cost of a trip from one city (s) to another one (t) that takes into account all the possible travel plans (nonstop, one stop, two stops etc.). This minimal cost does not exceed a[s] [t] but may be smaller. We allow a[i] [j] to be negative for some i and j (you are paid if you agree to use some flight).

Cited by 0