18 search results - page 2 / 4 » njc 2006 |
NJC
2006
13 years 5 months ago
2006
NJC
2002
13 years 5 months ago
2002
NJC
1998
13 years 5 months ago
1998
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
NJC
2006
13 years 5 months ago
2006
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
NJC
2000
13 years 5 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...