Hadi Alizadeh

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an(More)
Connexins are a 21-member membrane protein family constituting channels evolved in direct communication between adjacent cells by passaging cytoplasmic molecules and ions. Hexametrical assembly of connexin proteins in plasma membrane forms a wide aqueous pore known as connexin hemichannel. These hemichannels mediate cytoplasm and extracellular milieu(More)
In this paper, we focus on energy efficient virtual network embedding in federated (multi-domain) software defined networks (SDN), where a top (high-level) SDN controller manages the other SDN controllers, each of which is responsible the network management of its own domain. We propose a heuristic algorithm that performs virtual network embedding by aiming(More)
  • 1