1188 search results - page 49 / 238 » Extended Graph Unification |
124
Voted
CAV
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
112
Voted
PR
2008
15 years 23 days ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
101
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted ...
125
click to vote
FCT
2003
Springer
15 years 6 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...