A note on finding the bridges of a graph

R. Endre Tarjan

doi:10.1016/0020-0190(74)90003-9

A note on finding the bridges of a graph

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

Original language	English (US)
Pages (from-to)	160-161
Number of pages	2
Journal	Information Processing Letters
Volume	2
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(74)90003-9
State	Published - Apr 1974
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

algorithm
bridge
connectivity
search
spanning tree

Access to Document

10.1016/0020-0190(74)90003-9

Cite this

@article{532e789f720f4958b3da055360a6e861,

title = "A note on finding the bridges of a graph",

keywords = "algorithm, bridge, connectivity, search, spanning tree",

author = "Tarjan, {R. Endre}",

year = "1974",

month = apr,

doi = "10.1016/0020-0190(74)90003-9",

language = "English (US)",

volume = "2",

pages = "160--161",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - A note on finding the bridges of a graph

AU - Tarjan, R. Endre

PY - 1974/4

Y1 - 1974/4

KW - algorithm

KW - bridge

KW - connectivity

KW - search

KW - spanning tree

UR - http://www.scopus.com/inward/record.url?scp=0015772414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015772414&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(74)90003-9

DO - 10.1016/0020-0190(74)90003-9

M3 - Article

AN - SCOPUS:0015772414

SN - 0020-0190

VL - 2

SP - 160

EP - 161

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

A note on finding the bridges of a graph

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Cite this