LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
Publisher	ACM (Order n 508830)
Pages	246-251
Number of pages	6
ISBN (Print)	0897910990
State	Published - Dec 1 1983

All Science Journal Classification (ASJC) codes

@inproceedings{4fbdc61dae7a42d4aa7f39338dd39fe5,

title = "LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION.",

author = "Gabow, {Harold N.} and Tarjan, {Robert Endre}",

year = "1983",

month = dec,

day = "1",

language = "English (US)",

isbn = "0897910990",

pages = "246--251",

booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "ACM (Order n 508830)",

}

TY - GEN

T1 - LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION.

AU - Gabow, Harold N.

AU - Tarjan, Robert Endre

PY - 1983/12/1

Y1 - 1983/12/1

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

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

M3 - Conference contribution

AN - SCOPUS:0020921596

SN - 0897910990

SP - 246

EP - 251

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM (Order n 508830)

ER -