18 search results - page 2 / 4 » njc 2006 |
70
Voted
NJC
2006
15 years 19 days ago
2006
NJC
2002
15 years 10 days ago
2002
75
Voted
NJC
1998
15 years 10 days 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 ...
92
Voted
NJC
2006
15 years 19 days 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...
112
click to vote
NJC
2000
15 years 14 days 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...