1. Carla Piazza and ALBERTO POLICRITI. Ackermann encoding, bisimulations and OBDDs. Theory and Practice of Logic Programming, 4:695--718, 2004.
   Keywords: graph theory, model theory, honours reading. [abstract] [bibtex-entry]



2. A. Dovier and C. Piazza. The Subgraph Bisimulation Problem. IEEE Transactions on Knowledge & Data Engineering, 15(4):1055--6, 2003.
   Note: Publisher: IEEE, USA.
   Keywords: graph theory, model theory, honours reading, graph matching. [abstract] [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.