Graph theory applications to continuity and ranking in geologic models

Computers and Geosciences

Volumn 25, Issue 2, 1999, Pages 127-139

  Hirsch, L M ^a   Schuette, J F ^a  

^a EXXONMOBIL UPSTREAM RESEARCH COMPANY   (United States)

Author keywords

Connectivity; Continuity; Geologic models; Graph theory; Reservoirs

Indexed keywords

ALGORITHM; GEOLOGY; MODELING; RESERVOIR CHARACTERIZATION;

EID: 0033020556     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-3004(98)00116-2     Document Type: Article

References (16)

1. Chartrand, G., 1985. Introductory Graph Theory. Dover, Mineola, New York, 294 pp.
2. Cherkassky B.V., Goldberg A.V., Radzik T. Shortest path algorithms: theory and experimental evaluation. Mathematical Programming. 73(2):1996;129-174.
3. Deo N., Pang C. Shortest-path algorithms: taxonomy and annotation. Networks. 14(2):1984;275-323.
4. Deutsch, C.V., Cockerham, P.W., 1994. Geostatistical modeling of porosity and permeability with annealing cosimulation. In: Proceedings 69th Annual Technical Conference and Exhibition of the SPE, SPE 28413. New Orleans, Louisiana, 25-28 Sept., pp. 523-528.
5. Deutsch, C.V., Srinivasan, S., 1996. Improved reservoir management through ranking stochastic reservoir models. In: Proceedings SPE/DOE Tenth Symposium on Improved Oil Recovery, SPE/DOE 35411. Tulsa, Oklahoma, 21-24 April, pp. 105-111.
6. Euler L. The solution of a problem relating to the geometry of position, reprinted translation. Scientific American. 189(1):1736;66-70. (translation year 1953).
7. Evans, J.R., Minieka, E., 1992. Optimization Algorithms for Networks and Graphs, 2nd ed. Marcel Dekker, New York, 470 pp.
8. Ford, L.R., Jr., Fulkerson, D.R., 1962. Flows in Networks. Princeton University Press, Princeton, New Jersey, 194 pp.
9. Gallo G., Pallotino S. Shortest path methods: a unifying approach. Mathematical Programming Study. 26:1986;38-64.
10. Johnson, D.S., McGeoch, C.C. (Eds.), 1993. Network Flows and Matching: First DIMACS Implementation Challenge. American Mathematical Society, 592 pp.
11. Journel A. Geostatistics: models and tools for the earth sciences. Mathematical Geology. 18(1):1986;119-140.
12. Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings American Mathematical Society. 7(1):1956;48-50.
13. Lau, H.T., 1989. Algorithms on Graphs. Tab Books, McGraw Hill, Blue Ridge Summit, Pennsylvania, 231 pp.
14. Prim R.C. Shortest connection networks and some generalizations. Bell Systems Technology Journal. 36(6):1957;1389-1401.
15. Yang G., Myer L.R., Brown S.R., Cook N.G.W. Microscopic analysis of macroscopic transport properties of single natural fractures using graph theory algorithms. Geophysical Research Letters. 22(11):1995;1429-1432.
16. Xu Y., Uberbacher E.C. 2D image segmentation using minimum spanning trees. Image and Vision Computing. 15(1):1997;47-57.