641 search results - page 33 / 129 » On Planar Quasi-Parity Graphs |
100
click to vote
IJBC
2002
15 years 1 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
142
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
114
click to vote
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
123
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
113
click to vote
DAM
1999
15 years 1 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...