4201 search results - page 117 / 841 » Interaction graphs: Additives |
137
click to vote
ENTCS
2008
15 years 4 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
128
click to vote
TIP
2008
15 years 4 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
143
click to vote
JNW
2007
15 years 4 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
130
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
151
click to vote
COR
2011
14 years 11 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...