Array-aware matching: taming the complexity of large-scale simulation models

DOI10.1145/3611661MaRDI QIDQ6601388

Silvano Seva, F. Casella, Federico Terraneo, Daniele Cattaneo, Stefano Cherubin, Leva, Alberto, Giovanni Agosta, Massimo Fioravanti

Publication date: 10 September 2024

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

zbMATH Keywords

NP-completeness proofarray-aware matchingequation-based modeling languages

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• SUNDIALS
• Mathematics in industrial problems. Part 5
• Some simplified NP-complete graph problems
• Modeling and simulation of large-scale systems: a systematic comparison of modeling paradigms
• Maximal Flow Through a Network
• Object-oriented modelling and simulation of a motorcycle
• The Consistent Initialization of Differential-Algebraic Systems
• Depth-First Search and Linear Graph Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Array-aware matching: taming the complexity of large-scale simulation models