A novel graph-based partitioning algorithm for large-scale dynamical systems
From MaRDI portal
Recommendations
- An efficient approach for large scale graph partitioning
- scientific article; zbMATH DE number 1617249
- scientific article; zbMATH DE number 991436
- Graph partitioning for scalable distributed graph computations
- Advanced coarsening schemes for graph partitioning
- Graph partitioning based methods and tools for scientific computing
- A computational study of graph partitioning
- Parallel static and dynamic multi‐constraint graph partitioning
Cited in
(8)- A decomposition-based control strategy for large, sparse dynamic systems
- Online partitioning method for decentralized control of linear switching large-scale systems
- Data-driven process decomposition and robust online distributed modelling for large-scale processes
- Partitioning of relative sensing networks: a stability margin perspective
- Weighted directed graph based community detection for subsystem decomposition
- A simulation perspective: error analysis in the distributed simulation of continuous system
- A new key performance indicator oriented industrial process monitoring and operating performance assessment method based on improved Hessian locally linear embedding
- A partitioned combined computational method for multi‐scale dynamic systems
This page was built for publication: A novel graph-based partitioning algorithm for large-scale dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265595)
