Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kincaid, D. T.
Right arrow Articles by Pilette, R.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Kincaid, D. T.
Right arrow Articles by Pilette, R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Construction of simple pathways and simple cycles in ecosystems

Dwight T. Kincaid and Ron Pilette 1

Department of Biological Sciences, Lehman College, City University of New York Bronx, NY 10468
1Science Department, John Jay College, City University of New York 445 West 59th Street, New York, NY 10019, USA

We present software tools for overcoming the problem of combinatorics in the enumeration of simple pathways and simple cycles in a first flow-through analysis of carbon transfer in large ecosystems. Rather than search through the very large number of potential routes in a reasonably sized ecosystem for the relatively small number of actual routes, our main algorithm performs an efficient rule-based construction of the actual routes. The enumeration of the unique pathways becomes tractable in terms of CPU time, which increases linearly with ecosystem size and connectedness. Networks of up to 80 entities can be evaluated using our software.

Received on August 20, 1991; accepted on November 24, 1991

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.