D. R. Fulkerson | Academic Influence

D. R. Fulkerson's AcademicInfluence.com Rankings

D. R. Fulkerson

Mathematics

#1342

Historical Rank

Measure Theory

#690

Historical Rank

mathematics Degrees

Download Badge

Mathematics

D. R. Fulkerson's Degrees

PhD Mathematics Princeton University

Why Is D. R. Fulkerson Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Delbert Ray Fulkerson was an American mathematician who co-developed the [[FordFulkerson algorithm]], one of the most well-known algorithms to solve the maximum flow problem in networkss. Early life and education D. R. Fulkerson was born in Tamms, Illinois, the third of six children of Elbert and Emma Fulkerson. Fulkerson became an undergraduate at Southern Illinois University. His academic career was interrupted by military service during World War II. Having returned to complete his degree after the war, he went on to do a Ph.D. in mathematics at the University of Wisconsin–Madison under the supervision of Cyrus MacDuffee, who was a student of L. E. Dickson. Fulkerson received his Ph.D. in 1951.

(See a Problem?)

D. R. Fulkerson's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Flows in Networks (1963) (3369)
Maximal Flow Through a Network (1956) (2858)
Solution of a Large-Scale Traveling-Salesman Problem (1954) (1838)
Incidence matrices and interval graphs (1965) (1252)
Constructing Maximal Dynamic Flows from Static Flows (1958) (600)
Blocking and anti-blocking pairs of polyhedra (1971) (448)
A Network Flow Computation for Project Cost Curves (1961) (382)
On edge-disjoint branchings (1976) (312)
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem (1957) (308)
MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE (1954) (293)
An Out-of-Kilter Method for Minimal-Cost Flow Problems (1960) (291)
Transversals and Matroid Partition (1965) (246)
Maximizing the minimum source-sink path subject to a budget constraint (1975) (240)
On the Max Flow Min Cut Theorem of Networks. (1955) (205)
Anti-blocking polyhedra (1972) (193)
Solving a Transportation Problem (1956) (161)
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem (1959) (161)
Expected Critical Path Lengths in PERT Networks (1962) (153)
Some Properties of Graphs with Multiple Edges (1965) (148)
Note on Dilworth’s decomposition theorem for partially ordered sets (1956) (128)
7* A Primal-Dual Algorithm for Linear Programs (1957) (123)
Flow Networks and Combinatorial Operations Research (1966) (112)
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems (1974) (104)
Packing rooted directed cuts in a weighted directed graph (1974) (103)
On balanced matrices (1974) (95)
Zero-one matrices with zero trace. (1960) (91)
Computation of maximal flows in networks (1955) (77)
A primal‐dual algorithm for the capacitated Hitchcock problem (1957) (75)
An algorithm for scaling matrices. (1962) (72)
Increasing the Capacity of a Network: The Parametric Budget Problem (1959) (58)
On the Perfect Graph Theorem (1973) (57)
Network Flow and Systems of Representatives (1958) (50)
NETWORKS, FRAMES, BLOCKING SYSTEMS (1967) (46)
A Network-Flow Feasibility Theorem and Combinatorial Applications (1959) (41)
Multiplicities and Minimal Widths for (0, 1)-Matrices (1962) (36)
Flows in infinite graphs (1970) (29)
The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones (1964) (28)
Widths and Heights of (0,1) -Matrices (1961) (28)
Studies in graph theory (1976) (27)
Upsets in Round Robin Tournaments (1965) (26)
A PRIMAL--DUAL ALGORITHM (1956) (25)
Incidence matrices with the consecutive 1's property (1964) (24)
Blocking Pairs of Polyhedra Arising from Network Flows (1975) (23)
EDGE COLORINGS IN BIPARTITE GRAPHES (1966) (23)
Width Sequences for Special Classes of (0, 1)-Matrices (1963) (23)
Minimal k-arc connected graphs (1971) (22)
SCHEDULING IN PROJECT NETWORKS (1964) (16)
A Tactical Air Game (1957) (16)
Perspectives on optimization : a collection of expository articles (1972) (14)
Polyhedral combinatorics : dedicated to the memory of D. R. Fulkerson (1978) (12)
Notes on Linear Programming (1954) (9)
Problems for Solution: E1275-E1280 (1957) (8)
Traces, Term Ranks, Widths and Heights (1960) (7)
NOTES ON COMBINATORIAL MATHEMATICS: ANTI-BLOCKING POLYHEDRA (1970) (7)
Notes on Linear Programming — Part XXXII (1956) (5)
DISJOINT COMMON PARTIAL TRANSVERSALS OF TWO FAMILIES OF SETS (1969) (4)
HITCHCOCK TRANSPORTATION PROBLEM (1956) (3)
Construction of maximal dynamic flows in networks. (1957) (2)
The Mathematical Programming Society (1977) (2)
Comments on "Solution of the quota problem by a successive-reduction method.". (1958) (2)
An algorithm for scaling matrices: notes on linear programming and extensions-part 58. (1962) (1)
TRANSVERSAL PACKINGS AND COVERS (1965) (0)
CHAPTER I. STATIC MAXIMAL FLOW (1963) (0)
SUBGRAPHS OF BIPARTITE AND DIRECTED GRAPHS (1965) (0)
Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows (1957) (0)
Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm (1956) (0)
Notes on Linear Programming: Part XX Maximal Flow Through a Network (1954) (0)
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS (1963) (0)
CHAPTER 2 Basics of Graph Theory (0)
On the equivalence of the capacity-constrained transshipment problem and the Hitdhcock problem : notes on linear programming and extensions-part 53 (1960) (0)
NOTE ON A THEOREM OF DILWORTH (1955) (0)
CHAPTER III. MINIMAL COST FLOW PROBLEMS (1963) (0)
A Feasibility Criterion for Staircase Transportation Problems and an Application to a Scheduling Problem (1957) (0)
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS (1963) (0)

This paper list is powered by the following services:

Other Resources About D. R. Fulkerson

en.wikipedia.org

What Schools Are Affiliated With D. R. Fulkerson?

D. R. Fulkerson is affiliated with the following schools:

Image Attributions

Image Source for D. R. Fulkerson