• Title of article

    Comparing recent methods in graph partitioning

  • Author/Authors

    Guénoche، نويسنده , , A.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2005
  • Pages
    7
  • From page
    83
  • To page
    89
  • Abstract
    In this paper we summarize some recent ideas in graph partitioning. We describe three algorithms to cluster vertices of a simple graph and we compare them according to their ability to recover classes initially introduced in random graphs.
  • Keywords
    Density function , Simulation , graph partitioning , optimization
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2005
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1454093

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1454093