doi.org

Formal Procedures for Connecting Terminals with a Minimum Total Wire Length | Journal of the ACM

  • ️WeinbergerA.
  • ️Tue Oct 01 1957

New Citation Alert added!

This alert has been successfully added and will be sent to:

You will be notified whenever a record that you have chosen has been cited.

New Citation Alert!

First page of PDF

References

[1]

D. KONiG: Theorie der Endlichen und Unendlichen Graphen, Chelsea Publishing Co., 1950.

[2]

A. CAYLEY: A Theorem on Trees, Mathematical Papers, Vol. XIII, pp. 26-28.

[3]

H. PROFER, Neuer Beweis eines Satzes fiber Permutationen, Arch. Math. Phys. (3), 27 (1918), pp. 142-144.

[4]

J. B. KRUSKAL~ JR.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Amer. Math. Soc. 7 (1956), pp. 48--50.

  • Alghamdi MBoffi DBonizzoni F(2024)A greedy MOR method for the tracking of eigensolutions to parametric elliptic PDEsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116270(116270)Online publication date: Sep-2024
  • Romanuke V(2023)Building Minimum Spanning Trees under Maximum Edge Length ConstraintInformation Technology and Management Science10.7250/itms-2023-000326(17-26)Online publication date: 30-Nov-2023
  • El-Hamamsy LBruno BAvry SChessel-Lazzarotto FZufferey JMondada F(2023)The TACS Model: Understanding Primary School Teachers’ Adoption of Computer Science Pedagogical ContentACM Transactions on Computing Education10.1145/356958723:2(1-31)Online publication date: 14-Mar-2023
  • Show More Cited By

Index Terms

  1. Formal Procedures for Connecting Terminals with a Minimum Total Wire Length

      Recommendations

      • Wire length prediction in constraint driven placement

        SLIP '03: Proceedings of the 2003 international workshop on System-level interconnect prediction

        Experiments show that lengths of individual wires are different for different placement algorithms. To achieve accurate wire length prediction, some knowledge of a placer's details is necessary. We postulate that wire length prediction should be coupled ...

      Comments

      Information & Contributors

      Information

      Published In

      cover image Journal of the ACM

      Journal of the ACM  Volume 4, Issue 4

      Oct. 1957

      138 pages

      Copyright © 1957 ACM.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 October 1957

      Published in JACM Volume 4, Issue 4

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)126
      • Downloads (Last 6 weeks)26

      Reflects downloads up to 02 Mar 2025

      Other Metrics

      Citations

      • Alghamdi MBoffi DBonizzoni F(2024)A greedy MOR method for the tracking of eigensolutions to parametric elliptic PDEsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116270(116270)Online publication date: Sep-2024
      • Romanuke V(2023)Building Minimum Spanning Trees under Maximum Edge Length ConstraintInformation Technology and Management Science10.7250/itms-2023-000326(17-26)Online publication date: 30-Nov-2023
      • El-Hamamsy LBruno BAvry SChessel-Lazzarotto FZufferey JMondada F(2023)The TACS Model: Understanding Primary School Teachers’ Adoption of Computer Science Pedagogical ContentACM Transactions on Computing Education10.1145/356958723:2(1-31)Online publication date: 14-Mar-2023
      • Ye WZhou XZhou JChen CLi K(2023)Accelerating Attention Mechanism on FPGAs based on Efficient Reconfigurable Systolic ArrayACM Transactions on Embedded Computing Systems10.1145/354993722:6(1-22)Online publication date: 9-Nov-2023
      • Brumar IZacharopoulos GYao YRama SBrooks DWei G(2023)Early DSE and Automatic Generation of Coarse-grained Merged AcceleratorsACM Transactions on Embedded Computing Systems10.1145/354607022:2(1-29)Online publication date: 24-Jan-2023
      • Yamaoka KNakashima TWakabayashi YOno N(2023)Minimum-Spanning-Tree-Based Time Delay Estimation Robust to OutliersIEEE Access10.1109/ACCESS.2023.332701111(121284-121294)Online publication date: 2023
      • Grimm LSmyth SSchulz-Rosengarten AHanxleden RPouzet M(2022)From Lustre to Graphical Models and SCChartsACM Transactions on Embedded Computing Systems10.1145/3544973Online publication date: 29-Jul-2022
      • Dijkstra E(2022)A Note on Two Problems in Connexion with GraphsEdsger Wybe Dijkstra10.1145/3544585.3544600(287-290)Online publication date: 12-Jul-2022
      • Apthorpe NEmami-Naeini PMathur AChetty MFeamster N(2022)You, Me, and IoT: How Internet-connected Consumer Devices Affect Interpersonal RelationshipsACM Transactions on Internet of Things10.1145/35397373:4(1-29)Online publication date: 6-Sep-2022
      • Kudryavcev EMollinedo D(2021)Optimization of the Vehicle Movement ModesIOP Conference Series: Materials Science and Engineering10.1088/1757-899X/1079/2/0220961079:2(022096)Online publication date: 1-Mar-2021
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      Figures

      Tables

      Media