Shortest Paths in Nearly Conservative Digraphs

DOI10.1007/978-3-319-13524-3_20zbMath1456.68067arXiv1409.7033OpenAlexW1926168348MaRDI QIDQ2946022

Zoltán Király

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.7033

zbMATH Keywords

mixed graphFPT algorithmall-pairs shortest pathsconservative weights

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Shortest Paths in Nearly Conservative Digraphs

Cites Work

• Unnamed Item
• Minimum mean cycle problem in bidirected and skew-symmetric graphs
• On negative cycles in mixed graphs
• A characterization of the minimum cycle mean in a digraph
• A note upon minimal path problem
• Path problems in skew-symmetric graphs
• Shortest Paths in Nearly Conservative Digraphs

This page was built for publication: Shortest Paths in Nearly Conservative Digraphs