Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...