Complexity and Algorithms in Graphs
Most cited papers
- Introduction to AlgorithmsJournal of the Operational Research Society · 1991 · 16,959 citations
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics · 1968 · 13,470 citations
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society · 1994 · 8,132 citations
- Network information flowIEEE Transactions on Information Theory · 2000 · 7,801 citations
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing · 1972 · 6,441 citations
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing · 1998 · 5,991 citations
- Combinatorial Optimization: Algorithms and Complexity.American Mathematical Monthly · 1984 · 5,982 citations
- Theory of Linear and Integer ProgrammingJournal of the Operational Research Society · 2000 · 5,573 citations
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society · 1956 · 5,572 citations
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software · 1996 · 5,562 citations
- Integer and Combinatorial OptimizationJournal of the Operational Research Society · 1990 · 5,532 citations
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal · 1970 · 5,330 citations
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence · 2004 · 4,645 citations
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys · 1991 · 4,498 citations
Metadata from OpenAlex (CC0).