The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
Journal of the ACM (JACM)
Testing for the Church-Rosser Property
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Testing for cycles in infinite graphs with periodic structure
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient Computation of Expressions with Common Subexpressions
Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Discovering Frequent Closed Partial Orders from Strings
IEEE Transactions on Knowledge and Data Engineering
Reachability analysis for annotated code
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
Science of Computer Programming
Optimizing user views for workflows
Proceedings of the 12th International Conference on Database Theory
QuanTM: a quantitative trust management system
Proceedings of the Second European Workshop on System Security
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Strongest postcondition of unstructured programs
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
PDiffView: viewing the difference in provenance of workflow results
Proceedings of the VLDB Endowment
SP@CE: an SP-based programming model for consumer electronics streaming applications
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
Understanding research field evolving and trend with dynamic Bayesian networks
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Compiling Ladder Diagram into Instruction List to comply with IEC 61131-3
Computers in Industry
Recognition of directed acyclic graphs by spanning tree automata
Theoretical Computer Science
Extensions of decision-theoretic troubleshooting: cost clusters and precedence constraints
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Efficient deadlock avoidance for streaming computation with filtering
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Eventually consistent transactions
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Algorithms for core stability, core largeness, exactness, and extendability of flow games
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We present an algorithm that recognizes the class of General Series Parallel digraphs and runs in time proportional to the size of its input. To perform this recognition task it is necessary to compute the transitive reduction and transitive closure of any General Series Parallel digraph. Our analysis is based on the relationship between General Series Parallel digraphs and a class of well known models of electrical networks.