A characterization of positive spanning sets with ties to strongly edge-connected digraphs

2025/05/19 by Denis Cornaz, Sébastien Kerleau, Clément W. Royer · 1 voice
Computer Science · Engineering · #Advanced Graph Theory Research #Optimization and Packing Problems #VLSI and FPGA Design Techniques

paper · doi:10.1016/j.dam.2025.05.025

openalex publication_date 2025/05/19 · crossref created 2025/05/19 · crossref issued 2025/10/01 · crossref published 2025/10/01 · crossref published-print 2025/10/01 · openalex created_date 2025/10/10 · crossref deposited 2026/04/29 · crossref indexed 2026/05/03 · openalex updated_date 2026/07/22

Citations

• Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
• Theory of Positive Linear Dependence

Discussions

• 📖 New LAMSADE paper: A characterization of positive spanning sets with ties to strongly edge-connected digraphs. (Discret. Appl. Math.) https://doi.org/10.1016/j.dam.2025.05.025 [bsky, 0 points, 0 comments]