Search Results - "Gözüpek, Didem"

A survey on energy efficiency in software defined networks by Tuysuz, Mehmet Fatih, Ankarali, Zekiye Kubra, Gözüpek, Didem

“…Wide deployment and dense usage of computer networks may cause excessive energy consumption due to the increase in probability of network congestion, frame…”
Get full text

Well-indumatched Pseudoforests by Büyükçolak, Yasemin, Gözüpek, Didem, Özkan, Sibel

“…A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. [1] provided a characterization of…”
Get full text

Paired domination versus domination and packing number in graphs by Dettlaff, Magda, Gözüpek, Didem, Raczek, Joanna

“…Given a graph G = ( V ( G ) , E ( G ) ) , the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G…”
Get full text

On graphs all of whose total dominating sequences have the same length by Bahadır, Selim, Gözüpek, Didem, Doğan, Oğuz

“…A sequence of vertices in a graph G without isolated vertices is called a total dominating sequence if every vertex v in the sequence has a neighbor which is…”
Get full text

Complexity of edge coloring with minimum reload/changeover costs by Gözüpek, Didem, Shalom, Mordechai

“…In an edge‐colored graph, a traversal cost occurs along a path when consecutive edges with different colors are traversed. The value of the traversal cost…”
Get full text

Upper paired domination versus upper domination by Alizadeh, Hadi, Gözüpek, Didem

“…A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal…”
Get full text

Equimatchable Bipartite Graphs by Büyükçolak, Yasemin, Gözüpek, Didem, Özkan, Sibel

“…A graph is called equimatchable if all of its maximal matchings have the same size. Lesk [ , Graph Theory and Combinatorics (Academic Press, London, 1984)…”
Get full text

Minimum Reload Cost Graph Factors by Baste, Julien, Gözüpek, Didem, Shalom, Mordechai, Thilikos, Dimitrios M.

“…The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined…”
Get full text

Triangle‐free equimatchable graphs by Büyükçolak, Yasemin, Özkan, Sibel, Gözüpek, Didem

“…A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. provided a characterization of equimatchable graphs with…”
Get full text

Secure virtual network embedding with flexible bandwidth-based revenue maximization by Beşiktaş, Cihangir, Gözüpek, Didem, Ulaş, Aydın, Lokman, Erhan

“…Network virtualization is an effective way to overcome the ossification of Internet by enabling multiple virtual networks to coexist on a shared…”
Get full text

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability by Gözüpek, Didem, Özkan, Sibel, Paul, Christophe, Sau, Ignasi, Shalom, Mordechai

“…In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover…”
Get full text

Equimatchable graphs are C2k+1-free for k≥4 by Dibek, Cemil, Ekim, Tınaz, Gözüpek, Didem, Shalom, Mordechai

“…A graph is equimatchable if all of its maximal matchings have the same size. Equimatchable graphs are extensively studied in the literature mainly from…”
Get full text

(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs by Alizadeh, Hadi, Gözüpek, Didem, Ekinci, Gülnaz Boruzanlı

“…The of a graph is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in . The term referring to the graphs with…”
Get full text

Minimum reload cost cycle cover in complete graphs by Büyükçolak, Yasemin, Gözüpek, Didem, Özkan, Sibel

“…The reload cost refers to the cost that occurs along a path on an edge‐colored graph when it traverses an internal vertex between two edges of different…”
Get full text

Constructing minimum changeover cost arborescenses in bounded treewidth graphs by Gözüpek, Didem, Shachnai, Hadas, Shalom, Mordechai, Zaks, Shmuel

“…Given an edge-colored graph, an internal vertex of a path experiences a reload cost if it lies between two consecutive edges of different colors. The value of…”
Get full text

Parameterized complexity of finding a spanning tree with minimum reload cost diameter by Baste, Julien, Gözüpek, Didem, Paul, Christophe, Sau, Ignasi, Shalom, Mordechai, Thilikos, Dimitrios M.

“…We study the minimum diameter spanning tree problem under the reload cost model (Diameter‐Tree for short) introduced by Wirth and Steffan. In this problem,…”
Get full text

Energy efficient virtual network embedding for federated software‐defined networks by Dahir, Mohamed Haji, Alizadeh, Hadi, Gözüpek, Didem

“…Summary In this paper, we focus on energy efficient virtual network embedding in federated (multidomain) software‐defined networks (SDNs). We first formulate…”
Get full text

Joint overlay routing and relay assignment for green networks by Ekici, Fatma, Gözüpek, Didem

“…Power consumption of information and communication technologies (ICT) has increasingly become an important issue in the last years. Both energy costs and…”
Get full text

A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks by Gozupek, Didem, Shalom, Mordechai, Alagoz, Fatih

“…We focus on throughput-maximizing, max-min fair, and proportionally fair scheduling problems for centralized cognitive radio networks. First, we propose a…”
Get full text

On the complexity of constructing minimum changeover cost arborescences by Gözüpek, Didem, Shalom, Mordechai, Voloshin, Ariella, Zaks, Shmuel

“…The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges…”
Get full text