523 search results - page 37 / 105 » Decidability of string graphs |
104
click to vote
FSTTCS
1992
Springer
15 years 7 months ago
1992
Springer
The branching bisimulation de ned by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimu...
112
Voted
ENTCS
2002
15 years 3 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
128
click to vote
JGT
2008
15 years 3 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
178
click to vote
COMGEO
2011
ACM
14 years 10 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
116
Voted
ICALP
1994
Springer
15 years 7 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...