We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
We propose a method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline....