A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas

2012
*
Acta Universitaria
*

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 the graph representing the electrical network

doi:10.15174/au.2012.344
fatcat:velxeohga5bb5bqrnyn27po4ym