We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
In recent years, link-based information retrieval methods from the Web are developed. A framework of these methods is a Web graph using pages as vertices and Web-links as edges. In...
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz