Sciweavers

217 search results - page 14 / 44
» Elimination Graphs
Sort
View
SAC
2009
ACM
14 years 2 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
BPM
2010
Springer
134views Business» more  BPM 2010»
13 years 8 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
ICIP
2007
IEEE
14 years 1 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas
CP
2006
Springer
13 years 11 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
DIMACS
1996
13 years 9 months ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle