Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas.
Fuente:
Redalyc
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artículo científico |
| Lenguaje: | en |
| Publicado: |
Universidad de Guanajuato
2012
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1876438884863180800 |
|---|---|
| author | Guillermo De Ita Luna |
| author_facet | Guillermo De Ita Luna |
| contents | Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas. Guillermo De Ita Luna Helena Gómez Belem Merino Multidisciplinarias (Ciencias Sociales) SAT problem #SAT problem signed graph counting models electrical networks This article presents a practical method to count the different signed paths which maintain an electric charge on each one of the lines of an electrical network. We assume that there is just one charge (positive or negative) on each network node. We model the problem of counting the signed paths via the #2SAT problem. The #2SAT problem consists on counting models of Boolean formulas in two conjunctive forms. Our method is based on the topology of thegraph representing the electrical network and from which we get its Boolean formula in twoconjunctive form. A set of recurrence equations are applied, starting from the terminal nodes up to the root node of the network. Such recurrence equations allow us to compute #2SAT for the formula associated to the electrical network. The computed value (#2SAT) represents the different ways to keep charge on all line of the electrical network. 2012 artículo científico 0188-6266 https://www.redalyc.org/articulo.oa?id=41623190010 en http://www.redalyc.org/revista.oa?id=416 Acta Universitaria application/pdf Universidad de Guanajuato Acta Universitaria (México) Vol.22 |
| format | Artículo científico |
| id | redalyc_41623190010 |
| institution | Redalyc |
| language | en |
| publishDate | 2012 |
| publisher | Universidad de Guanajuato |
| spellingShingle | Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas. Guillermo De Ita Luna Multidisciplinarias (Ciencias Sociales) SAT problem #SAT problem signed graph counting models electrical networks Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas. Guillermo De Ita Luna Helena Gómez Belem Merino Multidisciplinarias (Ciencias Sociales) SAT problem #SAT problem signed graph counting models electrical networks This article presents a practical method to count the different signed paths which maintain an electric charge on each one of the lines of an electrical network. We assume that there is just one charge (positive or negative) on each network node. We model the problem of counting the signed paths via the #2SAT problem. The #2SAT problem consists on counting models of Boolean formulas in two conjunctive forms. Our method is based on the topology of thegraph representing the electrical network and from which we get its Boolean formula in twoconjunctive form. A set of recurrence equations are applied, starting from the terminal nodes up to the root node of the network. Such recurrence equations allow us to compute #2SAT for the formula associated to the electrical network. The computed value (#2SAT) represents the different ways to keep charge on all line of the electrical network. 2012 artículo científico 0188-6266 https://www.redalyc.org/articulo.oa?id=41623190010 en http://www.redalyc.org/revista.oa?id=416 Acta Universitaria application/pdf Universidad de Guanajuato Acta Universitaria (México) Vol.22 |
| title | Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas. |
| topic | Multidisciplinarias (Ciencias Sociales) SAT problem #SAT problem signed graph counting models electrical networks |
| url | https://www.redalyc.org/articulo.oa?id=41623190010 |