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

DOI10.1145/3611661MaRDI QIDQ6601388zbMATH OpenFDO

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

Publication date 10 September 2024

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

Full work available at URL https://doi.org/10.1145/3611661

zbMATH Keywords

array-aware matchingequation-based modeling languagesNP-completeness proof

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Continuous system simulation
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Mathematics in industrial problems. Part 5
• Maximal Flow Through a Network
• Modeling and simulation of large-scale systems: a systematic comparison of modeling paradigms
• Object-oriented modelling and simulation of a motorcycle
• Some simplified NP-complete graph problems
• SUNDIALS
• The Consistent Initialization of Differential-Algebraic Systems

Cited in

(1)

• Efficient matching in large DAE models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601388)