An algorithm for source location in directed graphs
type: Item
instance of: scholarly article
title: An algorithm for source location in directed graphs
zbMATH Open document ID: 1177.90243
author: Mihály Bárász
author: Johanna Becker
author: András Frank
published in: Operations Research Letters
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2173500
zbMATH Keywords: Source location
zbMATH Keywords: Edge-connectivity
zbMATH Keywords: Polynomial algorithm
Wikidata QID: Q56987179
MaRDI profile type: Publication
full work available at URL: j.orl.2004.07.005
OpenAlex ID: W2084815677
cites work: Q4871755
cites work: Q4093489
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
cites work: Transversals of subtree hypergraphs and the source location problem in digraphs
cites work: Q4664045
cites work: Q4398373
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Edge-connectivity augmentation problems
DOI: 10.1016/J.ORL.2004.07.005
description: scientific article; zbMATH DE number 2173500