Sciweavers

365 search results - page 51 / 73
» Reconfigurations in Graphs and Grids
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 10 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
P2P
2002
IEEE
178views Communications» more  P2P 2002»
14 years 3 months ago
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...
Mario T. Schlosser, Michael Sintek, Stefan Decker,...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
14 years 22 days ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
IANDC
2006
97views more  IANDC 2006»
13 years 11 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner