1883 search results - page 68 / 377 » Ordered theta graphs |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
Bottom-up segmentation methods merge similar neighboring regions according to a decision rule and a merging order. In this paper, we propose a contribution for each of these two po...
DM
2000
13 years 7 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
CADE
2001
Springer
14 years 8 days ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...