523 search results - page 1 / 105 » Decidability of string graphs |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
BIRTHDAY
2004
Springer
13 years 10 months ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
DEXAW
2009
IEEE
14 years 18 hour ago
2009
IEEE
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...