Todo DSpace

Listar por tema "Graph theory"

Mostrando ítems 1-11 de 11

    • Broadcasting with Mobile Agents in Dynamic Networks 

      Das S., Giachoudis N., Luccio F.L., Markou E. (2021)
      We study the standard communication problem of broadcast for mobile agents moving in a network. The agents move autonomously in the network and can communicate with other agents only when they meet at a node. In this model, ...

    • A communication-aware energy-efficient graph-coloring algorithm for VM placement in clouds 

      Tziritas N., Loukopoulos T., Khan S., Xu C.-Z., Zomaya A. (2018)
      The problem of virtual machine (VM) consolidation has received a lot of attention over the past years. Most of the proposed techniques tackling the VM consolidation problem focus on energy consumption ignoring the network ...

    • Data Replication and Virtual Machine Migrations to Mitigate Network Overhead in Edge Computing Systems 

      Tziritas N., Koziri M., Bachtsevani A., Loukopoulos T., Stamoulis G., Khan S.U., Xu C.-Z. (2017)
      Several virtual machine (VM) placement algorithms have been proposed and studied in the literature with various scopes such as server consolidation or network cost minimization. In most cases, decisions on VM migrations ...

    • Different speeds suffice for rendezvous of two agents on arbitrary graphs 

      Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017)
      We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse ...

    • Exclusive graph searching vs. pathwidth 

      Markou E., Nisse N., Pérennes S. (2017)
      In Graph Searching, a team of searchers aims at capturing an invisible fugitive moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a contaminated network. The problem is to compute the minimum ...

    • Exploring graphs with time constraints by unreliable collections of mobile robots 

      Czyzowicz J., Godon M., Kranakis E., Labourel A., Markou E. (2018)
      A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is ...

    • LIDS - An easy to use and lightweight, infectious disease simulator 

      Siklafidis T., Vlachos V. (2021)
      The progression of infectious diseases, biological viruses and quick spreading pathogens is difficult to analyze, forecast and prevent. Many epidemiological compartmental models have been developed over the years to predict ...

    • Route Optimization of Electric Vehicles Based on Dynamic Wireless Charging 

      Kosmanos D., Maglaras L.A., Mavrovouniotis M., Moschoyiannis S., Argyriou A., Maglaras A., Janicke H. (2018)
      One of the barriers for the adoption of electric vehicles (EVs) is the anxiety around the limited driving range. Recent proposals have explored charging EVs on the move, using dynamic wireless charging which enables power ...

    • A statistically-based engine for P/G network optimization 

      Karampatzakis, D. P.; Evmorfopoulos, N. E.; Stamoulis, G. I. (2005)
      The problem of optimum design of general (tree or graph-based) power distribution networks with respect to the voltage drop effect is addressed in this paper. A rigorous formulation based on linear circuit theory is ...

    • VisExpA: Visibility expansion algorithm in the topology of complex networks 

      Tsiotas D., Charakopoulos A. (2020)
      In this study, we provide the VisExpA (Visibility Expansion Algorithm), a computational code that implements a recently published method, which allows generating a visibility graph from a complex network instead of a ...

    • Visibility in the topology of complex networks 

      Tsiotas D., Charakopoulos A. (2018)
      Taking its inspiration from the visibility algorithm, which was proposed by Lacasa et al. (2008) to convert a time-series into a complex network, this paper develops and proposes a novel expansion of this algorithm that ...