Sciweavers

316 search results - page 19 / 64
» On almost self-complementary graphs
Sort
View
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
13 years 3 months ago
A distributed joint-learning and auction algorithm for target assignment
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...
Teymur Sadikhov, Minghui Zhu, Sonia Martíne...
CPC
2004
92views more  CPC 2004»
13 years 8 months ago
Large Topological Cliques in Graphs Without a 4-Cycle
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...
Daniela Kühn, Deryk Osthus
CVPR
2009
IEEE
15 years 4 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
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...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
DEXA
2003
Springer
130views Database» more  DEXA 2003»
14 years 1 months ago
Finding Neighbor Communities in the Web Using Inter-site Graph
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...
Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masa...
EVOW
2009
Springer
14 years 3 months ago
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
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