Packing rooted directed cuts in a weighted directed graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1974 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 6, pages 1-13 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Delbert Ray Fulkerson;

doi: 10.1007/bf01580218

Packing rooted directed cuts in a weighted directed graph

- Summary
- Subjects
- Metrics

Abstract

A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.

Related Organizations

Cornell University
United States

Keywords

Extremal problems in graph theory, Linear programming, Directed graphs (digraphs), tournaments, Programming involving graphs or networks, Software, source code, etc. for problems pertaining to combinatorics

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	70
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%