A good algorithm for edge-disjoint branching

Robert Endre Tarjan

doi:10.1016/0020-0190(74)90024-6

A good algorithm for edge-disjoint branching

Robert Endre Tarjan

Research output: Contribution to journal › Article › peer-review

Original language	English (US)
Pages (from-to)	51-53
Number of pages	3
Journal	Information Processing Letters
Volume	3
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(74)90024-6
State	Published - Nov 1974
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

branching
connectivity
directed graph
matroid
network flow
spanning tree

Access to Document

10.1016/0020-0190(74)90024-6

Cite this

@article{9927a707107c4f78bec1137e12c48b06,

title = "A good algorithm for edge-disjoint branching",

keywords = "branching, connectivity, directed graph, matroid, network flow, spanning tree",

author = "Tarjan, \{Robert Endre\}",

year = "1974",

month = nov,

doi = "10.1016/0020-0190(74)90024-6",

language = "English (US)",

volume = "3",

pages = "51--53",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A good algorithm for edge-disjoint branching

AU - Tarjan, Robert Endre

PY - 1974/11

Y1 - 1974/11

KW - branching

KW - connectivity

KW - directed graph

KW - matroid

KW - network flow

KW - spanning tree

UR - https://www.scopus.com/pages/publications/0038046003

UR - https://www.scopus.com/pages/publications/0038046003#tab=citedBy

U2 - 10.1016/0020-0190(74)90024-6

DO - 10.1016/0020-0190(74)90024-6

M3 - Article

AN - SCOPUS:0038046003

SN - 0020-0190

VL - 3

SP - 51

EP - 53

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

A good algorithm for edge-disjoint branching

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this