523 search results - page 39 / 105 » Decidability of string graphs |
128
Voted
CCCG
2001
15 years 4 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
128
Voted
ECEASST
2010
15 years 25 days ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
134
Voted
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
117
click to vote
DILS
2005
Springer
15 years 5 months ago
2005
Springer
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
150
click to vote
TEC
2002
15 years 3 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...