Sciweavers

5473 search results - page 236 / 1095
» On the graph isomorphism problem
Sort
View
FCT
2009
Springer
15 years 12 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
DAGSTUHL
2006
15 years 8 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
IJRR
2006
116views more  IJRR 2006»
15 years 7 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
EVOW
2007
Springer
16 years 1 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 11 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi