Sciweavers

6740 search results - page 89 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
14 years 3 months ago
A Tale of Two Filters - On-Line Novelty Detection
Abstract— For mobile robots, as well as other learning systems, the ability to highlight unexpected features of their environment – novelty detection – is very useful. One pa...
Paul A. Crook, Stephen Marsland, Gillian Hayes, Ul...
ECEASST
2008
73views more  ECEASST 2008»
13 years 10 months ago
A Graph-Based Type Representation for Objects
Abstract: Subtyping and inheritance are two major issues in the research and development of object-oriented languages, which have been traditionally studied along the lines of type...
Cong-Cong Xing
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
DAM
2011
13 years 5 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
JUCS
2010
117views more  JUCS 2010»
13 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...