| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437225 | Theoretical Computer Science | 2012 | 9 Pages |
Abstract
In this paper, we introduce and study polynomial graph transformability as a graph-transformational counterpart of the satisfiability problem of the propositional calculus.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
