1188 search results - page 61 / 238 » Extended Graph Unification |
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
RELMICS
1997
Springer
14 years 2 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
JCT
2008
13 years 10 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
DEDS
2002
13 years 9 months ago
2002
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...