• DocumentCode
    1372900
  • Title

    Making connections [graph theory]

  • Author

    Beichl, Isabel ; Sullivan, Francis

  • Author_Institution
    Comput. & Appl. Math. Lab., Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA
  • Volume
    3
  • Issue
    3
  • fYear
    1996
  • Firstpage
    9
  • Lastpage
    12
  • Abstract
    One of the problems that occurs repeatedly in scientific computing is deciding whether an object is connected or disconnected. It happens that this question is related to finding a spanning tree for a graph. In other words, if you have a set of points with connections between some pairs of them, you would like the least number of connections that still keeps the set connected. You can find this minimum spanning tree with a method called depth first search, among other ways. The paper addresses the question of determining connected components
  • Keywords
    graph theory; natural sciences computing; tree searching; connected components; depth first search; graph theory; minimum spanning tree; object connections; scientific computing; Scientific computing; Tree graphs; Writing;
  • fLanguage
    English
  • Journal_Title
    Computational Science & Engineering, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9924
  • Type

    jour

  • DOI
    10.1109/99.537087
  • Filename
    537087
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1372900