Sciweavers

491 search results - page 28 / 99
» On cyclically orientable graphs
Sort
View
CORR
2008
Springer
135views Education» more  CORR 2008»
15 years 3 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
Thomas Thierauf, Fabian Wagner
WG
2010
Springer
15 years 27 days ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
TROB
2008
95views more  TROB 2008»
15 years 2 months ago
Multisensor Input for CPG-Based Sensory---Motor Coordination
This paper describes a method for providing in real time a reliable synchronization signal for cyclical motions such as steady-state walking. The approach consists in estimating on...
Rodolphe Héliot, Bernard Espiau
DCG
2000
90views more  DCG 2000»
15 years 2 months ago
On the Cocircuit Graph of an Oriented Matroid
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
Raul Cordovil, Komei Fukuda, António Guedes...
108
Voted
BPM
2010
Springer
134views Business» more  BPM 2010»
15 years 4 months ago
A New Semantics for the Inclusive Converging Gateway in Safe Processes
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
Hagen Völzer