DOI: 10.1016/0025-5564(83)90063-9
关键词: Ecological network analysis 、 Cycling 、 Directed acyclic graph 、 Ecosystem 、 Ecology 、 Simple (abstract algebra) 、 Residual 、 Mathematics 、 Distributed computing 、 Structure (mathematical logic) 、 Flow (mathematics) 、 General Biochemistry, Genetics and Molecular Biology 、 Modelling and Simulation 、 Statistics and Probability 、 General Immunology and Microbiology 、 Applied mathematics 、 General Agricultural and Biological Sciences 、 General Medicine
摘要: Given a steady-state network of flows within an ecosystem, it becomes possible to systematically and automatically enumerate all distinct simple cycles flows. Cycles may be grouped according shared smallest arcs. The original then decomposed into web purely cycled flow residual acyclic graph consisting once-through pathways. aggregation elementary vulnerable arcs seems particularly effective in locating those transfers which stress is most likely disturb.