<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2005-09-30 15:47:37Tree decomposition Path decomposition Width Boolean satisfiability problem Graph theory Theoretical computer science Graph operations |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Date: 2005-09-30 15:47:37Tree decomposition Path decomposition Width Boolean satisfiability problem Graph theory Theoretical computer science Graph operations |
Add to Reading List |
Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy