Showing papers on "Time complexity published in 1971"
01 Jan 1971
TL;DR: An algorithm for determining whether two planar triply connected graphs are isomorphic is developed and the asymptotic growth rate of the algorithm grows as n log n where n is the number of vertices in the graph.
Abstract: It is shown that the isomorphism problem for triply connected planar graphs can be reduced to the problem of minimizing states in a finite automaton. By making use of an n log n algorithm for minimizing the number of states in a finite automaton, an algorithm for determining whether two planar triply connected graphs are isomorphic is developed. The asymptotic growth rate of the algorithm grows as n log n where n is the number of vertices in the graph.
11 citations
TL;DR: In this article, a simple algorithm is presented by which uncontrollable (observable) states can be removed from the given state equations for linear time-varying systems, which is an extension of the technique given by Mayne [1] and makes use of time-variable controllability and observability matrices.
Abstract: A simple algorithm is presented by which uncontrollable (observable) states can be removed from the given state equations for linear time-varying systems. The algorithm is an extension of the technique given by Mayne [1] for linear time-invariant systems and makes use of time-variable controllability and observability matrices. It appears to be simpler than the existing methods [3]-[5].
4 citations