3928 search results - page 128 / 786 » order 2006 |
134
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of El...
156
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
117
click to vote
DM
2006
15 years 4 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
159
click to vote
ENDM
2006
15 years 4 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
148
click to vote
ENTCS
2006
15 years 4 months ago
2006
Patterns for property specification enable non-experts to write formal specifications that can be used for automatic model checking. The existing patterns identified in [6] allow ...