Skip to main content

1 Result(s)

within Halit Üster Remove this filter Mathematics Remove this filter

and

  1. No Access

    Article

    Algorithms for the design of network topologies with balanced disjoint rings

    We define the Balanced Disjoint Rings (BDR) problem as develo** a method to partition of the nodes in a network to form a given number of disjoint rings of minimum total link length in such a way that there ...

    Halit Üster, Sarath K. S. Kumar in Journal of Heuristics (2010)