Accession Number : AD0718804

Title :   An Algebraic Formulation of a Multiple Path Problem in a Planar Graph with Triple Connectivity.

Descriptive Note : Technical rept. 15 Feb 70-15 Feb 71,

Corporate Author : IIT RESEARCH INST CHICAGO ILL

Personal Author(s) : Cameron,Scott H.

Report Date : 22 FEB 1971

Pagination or Media Count : 19

Abstract : The report presents a formulation of the single layer printed circuit wiring problem which, to the author's knowledge, is the only known approach other than complete enumeration of all combinations of all possible paths that will generate a solution, i.e., a set of disjoint paths, in every case where a feasible solution exists. Whether the improvement in computational efficiency relative to complete enumeration is sufficient to permit this formulation to provide the basis of a practical computational procedure is still unknown. Its practicality depends on the facility with which a certain set of simultaneous Boolean equations may be solved in cases of practical interest. (Author)

Descriptors :   (*PRINTED CIRCUITS, CIRCUIT INTERCONNECTIONS), (*GRAPHICS, THEORY), ALGEBRAS, THEOREMS

Subject Categories : Electrical and Electronic Equipment
      Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE