On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs

DOI10.1080/10556788.2011.580745zbMath1238.05259OpenAlexW2064315315MaRDI QIDQ2885481

Viktor Mosenkis, Uwe Naumann

Publication date: 23 May 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.580745

zbMATH Keywords

edge eliminationvertex eliminationscarcitylinearized DAGminimal edge count

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On lower bounds for optimal Jacobian accumulation

Cites Work

• Unnamed Item
• Optimal Jacobian accumulation is NP-complete
• Evaluating Derivatives
• A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
• Computational Graphs and Rounding Error
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Computational differentiation: techniques, applications, and tools

This page was built for publication: On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs