Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,356,125 papers from all fields of science
Search
Sign In
Create Free Account
Fulkerson Prize
Known as:
Fulkerson
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
AKS primality test
Alan M. Frieze
Alexander Schrijver
Alistair Sinclair
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Dynamics On and Of Complex Networks V
M. Choudhury
,
Niloy Ganguly
,
+11 authors
Cnrs ENS Lyon
2011
Corpus ID: 995307
Vélo’v
2010
2010
Edge- and Node-Disjoint Paths in P Systems
M. Dinneen
,
Yun-Bum Kim
,
Radu Nicolescu
MeCBIC
2010
Corpus ID: 13055000
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system…
Expand
Review
2010
Review
2010
Review of Delbert Burkett, Rethinking the Gospel Sources, Volume 2: The Unity and Plurality of Q
Tobias Hägerland
2010
Corpus ID: 170469279
2004
2004
Die Anteromedialisierung der Tuberositas tibiae
P. D. D. Kohn
,
O. Steimer
,
R. Seil
Der Orthopade
2004
Corpus ID: 26438844
ZusammenfassungMit der Anteromedialisierung der Tuberositas tibiae (Fulkerson-Operation) steht ein zuverlässiges Verfahren zur…
Expand
1998
1998
Fast Data Transmission and Maximal Dynamic Flow
G. Xue
,
Shangzhi Sun
,
J. B. Rosen
Information Processing Letters
1998
Corpus ID: 205887991
1986
1986
Dominants and submissives of matching polyhedra
W. Cunningham
,
Jan Green-Krótki
Mathematical programming
1986
Corpus ID: 206818730
LetP be the convex hull of perfect matchings of a graphG=(V, E). The dominant ofP is {y∈RE∶y≥x for somex∈P}. A theorem of…
Expand
1980
1980
A note on some computationally difficult set covering problems
D. Avis
Mathematical programming
1980
Corpus ID: 19402650
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from…
Expand
1979
1979
On perfect graphs and polyhedra with (0, 1)-valued extreme points
C. Monma
,
L. Trotter
Mathematical programming
1979
Corpus ID: 38076400
LetC andA be (0, 1)-valued matrices with no zero columns. Fulkerson has shown that the extreme points of {x: Cx ≤ 1,x ≥ 0} are…
Expand
1972
1972
An Estimate of Expected Critical-Path Length in PERT Networks
J. Lindsey
Operational Research
1972
Corpus ID: 33851975
The estimate of expected critical-path length in PERT networks in this paper is usually better than the Fulkerson estimate…
Expand
Highly Cited
1963
Highly Cited
1963
A Structural Method of Computing Project Cost Polygons
W. Prager
1963
Corpus ID: 61682635
For a project that consists of numerous jobs subject to technological ordering restrictions the polygon representing project cost…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE