An Algorithm for Testing the Planarity of Partially Oriented Graphs.

reportActive / Technical Report | Accession Number: ADA048052 | Open PDF

Abstract:

An efficient algorithm will be presented for testing the planarity of oriented and partially oriented graphs. This algorithm is very useful for solving problems related to the circuit layout problem. Author

Author(s):
Vancleemput, W. M.
Author Organization(s):
STANFORD UNIV CALIF DIGITAL SYSTEMS LAB
Descriptive Note:
Technical note,
Pagination:
0012

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
DSL-TN-116
Contract/Grant Number(s):
N00014-75-C-0601
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_1_Force Support; JCA_5.2_Understand; JCA_1.2_Force Preparation; JCA_3.2_Engagement; JCA_3_Force Application; JCA_6.4.1_Secure Information Exchange; JCA_3.2.1_Kinetic Means; JCA_6_Net Centric; JCA_4.6_Engineering; JCA_1.2.3_Educating; JCA_6.4_Information Assurance
Modernization Areas:
Microelectronics; Fully Networked C3
Communities of Interest:
Advanced Electronics
Descriptor(s):
*GRAPHS, *CIRCUIT ANALYSIS, MATHEMATICAL MODELS, ALGORITHMS, TEST METHODS, INTEGRATED CIRCUITS, PRINTED CIRCUITS
Field(s)/Group(s):
Electrical and Electronic Equipment, Theoretical Mathematics
Keyword(s):
*Graph theory, Hypergraphics
Report Date:
1977 Jun 01