Congestion and Almost Invariant Sets in Dynamical Systems-Reference-Cited by-同舟云学术

Congestion and Almost Invariant Sets in Dynamical Systems

Published:2003 Issue: Volume: Page:183-209
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Dellnitz Michael,Preis Robert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45084-X_8

Reference44 articles.

1. N. Alon. On the edge-expansion of graphs. Combinatories, Probability and Computing, 6:145–152, 1997.

2. Lect Notes Comput Sci;S.L. Bezroukov,2000

3. N. Bouhmala. Impact of different graph coarsening schemes on the quality of the partitions. Technical Report RT98/05-01, University of Neuchatel, Department of Computer Science, 1998.

4. F.R.K. Chung. Spectral Graph Theory, volume 92 of CBMS Regional conference series in mathematics. American Mathematical Society, 1997.

5. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Network-based study of Lagrangian transport and mixing;Nonlinear Processes in Geophysics;2017-10-20

2. Modularity revisited: A novel dynamics-based concept for decomposing complex networks;Journal of Computational Dynamics;2014

3. Local expansion concepts for detecting transport barriers in dynamical systems;Communications in Nonlinear Science and Numerical Simulation;2009-12

4. Reduced Stochastic Models for Complex Molecular Systems;Computing and Visualization in Science;2006-05-30

5. Return Time Dynamics as a Tool for Finding Almost Invariant Sets;Annals of the New York Academy of Sciences;2005-12-01