Bilgisayar Mühendisliği Bölümü Koleksiyonu by Institution Author "Diner, Öznur Yaşar"
Now showing items 1-5 of 5
-
Contraction and deletion blockers for perfect graphs and H-free graphs
Diner, Öznur Yaşar; Paulusma, Daniel; Picouleau, Christophe; Ries, Bernard (Elsevier Science, 2018)We study the following problem: for given integers d k and graph G can we reduce some fixed graph parameter pi of G by at least d via at most k graph operations from some fixed set S? As parameters we take the chromatic ... -
Contraction Blockers for Graphs with Forbidden Induced Paths
Diner, Öznur Yaşar; Paulusma, Daniel; Picouleau, Christophe; Ries, Bernard (Springer-Verlag Berlin, 2015)We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: ... -
Strategic Early Warning System for the French milk market: A graph theoretical approach to foresee volatility
Bisson, Christophe; Diner, Öznur Yaşar (Elsevier, 2017)This paper presents a new approach for developing a Strategic Early Warning System aiming to better detect and interpret weak signals. We chose the milk market as a case study in line with the recent call from the EU ... -
Three-fast-searchable graphs
Dereniowski, Dariusz; Diner, Öznur Yaşar; Dyer, Danny (Elsevier Science Bv, 2013)In the edge searching problem searchers move from vertex to vertex in a graph to capture an invisible fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which at every ...