On negative cycles in mixed graphs

DOI10.1016/0167-6377(85)90013-6zbMath0585.05017OpenAlexW2006587925MaRDI QIDQ1071027

Esther M. Arkin, Christos H. Papadimitriou

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90013-6

zbMATH Keywords

algorithmshortest pathNP-completemixed graphsnegative cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)

Related Items (1)

Shortest Paths in Nearly Conservative Digraphs

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of circulations
• On the complexity of edge traversing
• Matching, Euler tours and the Chinese postman
• A Theorem on Boolean Matrices

This page was built for publication: On negative cycles in mixed graphs