22 search results - page 2 / 5 » Searching for a k-clique in unknown graphs |
84
Voted
OPODIS
2007
15 years 1 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
100
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
CP
2006
Springer
15 years 3 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
IJRR
2000
14 years 11 months ago
2000
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
110
Voted
AE
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...