• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4624131)   Today's Articles (38)   Subscriber (49410)
For:  [Subscribe] [Scholar Register]
Number Cited by Other Article(s)
1
Thomborson CD, Deneen LL, Shute GM. Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time. LECTURE NOTES IN COMPUTER SCIENCE 1987. [DOI: 10.1007/3-540-18099-0_44] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
2
Hwang F. An O(n log n) algorithm for suboptimal rectilinear Steiner trees. ACTA ACUST UNITED AC 1979. [DOI: 10.1109/tcs.1979.1084551] [Citation(s) in RCA: 50] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
3
Lee J, Bose N, Hwang F. Use of Steiner's problem in suboptimal routing in rectilinear metric. ACTA ACUST UNITED AC 1976. [DOI: 10.1109/tcs.1976.1084243] [Citation(s) in RCA: 57] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
4
Yang Y, Wing O. On a multinet wiring problem. ACTA ACUST UNITED AC 1973. [DOI: 10.1109/tct.1973.1083680] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA