Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
Publication
, Journal Article
Reif, JH
Published in: SIAM Journal on Computing
February 1983
Duke Scholars
Published In
SIAM Journal on Computing
DOI
EISSN
1095-7111
ISSN
0097-5397
Publication Date
February 1983
Volume
12
Issue
1
Start / End Page
71 / 81
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Related Subject Headings
- Computation Theory & Mathematics
- 4903 Numerical and computational mathematics
- 4901 Applied mathematics
- 4613 Theory of computation
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H. (1983). Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time. SIAM Journal on Computing, 12(1), 71–81. https://doi.org/10.1137/0212005
Reif, John H. “Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time.” SIAM Journal on Computing 12, no. 1 (February 1983): 71–81. https://doi.org/10.1137/0212005.
Reif JH. Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time. SIAM Journal on Computing. 1983 Feb;12(1):71–81.
Reif, John H. “Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time.” SIAM Journal on Computing, vol. 12, no. 1, Society for Industrial & Applied Mathematics (SIAM), Feb. 1983, pp. 71–81. Crossref, doi:10.1137/0212005.
Reif JH. Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM); 1983 Feb;12(1):71–81.
Published In
SIAM Journal on Computing
DOI
EISSN
1095-7111
ISSN
0097-5397
Publication Date
February 1983
Volume
12
Issue
1
Start / End Page
71 / 81
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Related Subject Headings
- Computation Theory & Mathematics
- 4903 Numerical and computational mathematics
- 4901 Applied mathematics
- 4613 Theory of computation
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics