Browsing by Subject "Weighted digraph"

Now showing items 1-4 of 4

    • Article  

      Distributed Balancing of Commodity Networks Under Flow Interval Constraints 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (2018)
      We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
    • Conference Object  

      Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems 

      Charalambous, T.; Hadjicostis, Christoforos N. (2013)
      We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
    • Conference Object  

      Distributed strategies for balancing a weighted digraph 

      Hadjicostis, Christoforos N.; Rikos, A. (2012)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...