CIAC
1997
Springer
14 years 7 months ago
1997
Springer
d abstract) G. Liotta1, R. Tamassia2, I. G. Tollis3, P. Vocca4 1 Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", via Salaria 113, 00198 Rome, Ita...
CIAC
1997
Springer
14 years 7 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
CIAC
1997
Springer
14 years 7 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...