Browsing by Author "Rikos, A. I."

Now showing items 1-5 of 5

    • Conference Object  

      Distributed balancing of a digraph with integer weights 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2013)
      We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
    • Conference Object  

      Distributed integer weight balancing within interval constraints 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2016)
      We consider distributed integer weight balancing in networks of nodes that are interconnected via directed edges, each able to admit a positive integer weight within a certain interval, captured by a lower and an upper ...
    • 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 ...
    • Conference Object  

      Distributed weight balancing under integer constraints in the presence of packet drops 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2018)
      A digraph with positive integer weights on its (directed) edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. We develop a distributed ...
    • Conference Object  

      Integer weight balancing in directed graphs in the presence of communication delays 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...