Marlene J. Colbourn

Learn More
The problem of deciding whether two graphs are isomorphic has attracted a significant amount of attention [6]. One of the reasons is that although the problem is not known to be NP-complete, no algorithm to solve it in polynomial (or even subexponential) time is known [18). Recently, many proofs have appeared demonstrating that testing isomorphism of random(More)
In this paper we argue that natural language interfaces to databases should be able to produce summary responses as well as listing actual data. We describe a system (incorporating a number of heuristics and a knowledge base built on top of the database) that has been developed to generate such summary responses. It is largely domain-independent, has been(More)
  • 1