1188 search results - page 65 / 238 » Extended Graph Unification |
108
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
114
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
132
click to vote
CIAC
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
130
click to vote
TAGT
1998
Springer
15 years 6 months ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
136
Voted
EJC
2008
15 years 2 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...