Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization

DOI10.1007/S10479-024-05890-0MaRDI QIDQ6581392zbMATH OpenFDO

Authors Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray

Publication date 30 July 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-05890-0

zbMATH Keywords

binary matrix visualizationcombinatorial optimizationgraph theoryscheduling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The triangle scheduling problem
• On the complexity of the independent set problem in triangle graphs
• scientific article; zbMATH DE number 1554936
• Obtaining a triangular matrix by independent row-column permutations
• Triangle packing on tripartite graphs is hard

Cites work

• How to survive while visiting a graph
• scientific article; zbMATH DE number 1047749 (Why is no real title available?)
• Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research
• Obtaining a triangular matrix by independent row-column permutations
• Operations Research and Capacity Expansion Problems: A Survey
• Scheduling. Theory, algorithms, and systems
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(1)

• Theory and methodology of time-dependent scheduling: past, present and future

This page was built for publication: Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization

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