5 citations · 5 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
Tınaz Ekim, Mordechai Shalom, Oylum Şeker
It is known that any chordal graph on vertices can be represented as the intersection of subtrees in a tree on nodes. This fact is recently used in [2] to generate rand…
cs.DS2018
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs
Oylum Şeker, Tınaz Ekim, Z. Caner Taşkın
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into…