Concepts inThe recognition of Series Parallel digraphs
Transitive reduction
In mathematics, a transitive reduction of a binary relation R on a set X is a minimal relation on X such that the transitive closure of is the same as the transitive closure of R. If the transitive closure of R is antisymmetric and finite, then is unique. However, neither existence nor uniqueness of transitive reductions is guaranteed in general.
more from Wikipedia
Transitive closure
In mathematics, the transitive closure of a binary relation R on a set X is the transitive relation R on set X such that R contains R and R is minimal . If the binary relation itself is transitive, then the transitive closure is that same binary relation; otherwise, the transitive closure is a different relation.
more from Wikipedia
Time complexity
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
more from Wikipedia
Electrical network
An electrical network is an interconnection of electrical elements such as resistors, inductors, capacitors, transmission lines, voltage sources, current sources and switches. An electrical circuit is a special type of network, one that has a closed loop giving a return path for the current.
more from Wikipedia