Work

Shortest Paths in Nearly Conservative Digraphs

Year: 2014

Type: book-chapter

Abstract: We introduce the following notion: a digraph $D=(V,A)$ with arc weights $c: A\rightarrow \R$ is called nearly conservative if every negative cycle consists of two arcs. Computing shortest paths in nearly conservative digraphs is NP-hard, and even deciding whether a digraph is nearly conservative is coNP-complete. We show that the "All Pairs Shortest Path" problem is fixed parameter tractable with various parameters for nearly conservative digraphs. The results also apply for the special case of conservative mixed graphs.

Source: Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)

DOI: 10.48550/arxiv.1409.7033

Author: Király, Zoltán

Institution: Eötvös Loránd University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949974377

FWCI:

Cites: 3

Cited by:

Related to: