Loading…
Contributions to a Theory of Wirability
The report concerns the generation of printed circuit wiring patterns by efficient automatic procedures. The major topics treated in the report include the following: An algebraic formulation of the planar wiring problem based on a hexagonal, i.e., triply connected, host network in which the existan...
Saved in:
Main Author: | |
---|---|
Format: | Report |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Cameron,Scott H |
description | The report concerns the generation of printed circuit wiring patterns by efficient automatic procedures. The major topics treated in the report include the following: An algebraic formulation of the planar wiring problem based on a hexagonal, i.e., triply connected, host network in which the existance of a solution to particular wiring problems depends on the consistency of a set of simultaneous Boolean equations; A graph theoretic formulation which solves the problem for two competing interconnection nets by the generation of a tree of non-separating paths in the host network; and A planarity testing procedure which generates a planar drawing of a particular type of graph, a so-called permutation graph, in all cases where the graph is planar. |
format | report |
fullrecord | <record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_AD0754451</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>AD0754451</sourcerecordid><originalsourceid>FETCH-dtic_stinet_AD07544513</originalsourceid><addsrcrecordid>eNrjZFB3zs8rKcpMKi3JzM8rVijJV0hUCMlIzS-qVMhPUwjPLEpMyszJLKnkYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4uBuamJiamhsYEpAENFyTj</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>Contributions to a Theory of Wirability</title><source>DTIC Technical Reports</source><creator>Cameron,Scott H</creator><creatorcontrib>Cameron,Scott H ; IIT RESEARCH INST CHICAGO ILL</creatorcontrib><description>The report concerns the generation of printed circuit wiring patterns by efficient automatic procedures. The major topics treated in the report include the following: An algebraic formulation of the planar wiring problem based on a hexagonal, i.e., triply connected, host network in which the existance of a solution to particular wiring problems depends on the consistency of a set of simultaneous Boolean equations; A graph theoretic formulation which solves the problem for two competing interconnection nets by the generation of a tree of non-separating paths in the host network; and A planarity testing procedure which generates a planar drawing of a particular type of graph, a so-called permutation graph, in all cases where the graph is planar.</description><language>eng</language><subject>ALGORITHMS ; AUTOMATIC ; Electrical and Electronic Equipment ; GRAPHICS ; GRAPHS ; NETWORK FLOWS ; PRINTED CIRCUITS</subject><creationdate>1973</creationdate><rights>APPROVED FOR PUBLIC RELEASE</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,27567,27568</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/AD0754451$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Cameron,Scott H</creatorcontrib><creatorcontrib>IIT RESEARCH INST CHICAGO ILL</creatorcontrib><title>Contributions to a Theory of Wirability</title><description>The report concerns the generation of printed circuit wiring patterns by efficient automatic procedures. The major topics treated in the report include the following: An algebraic formulation of the planar wiring problem based on a hexagonal, i.e., triply connected, host network in which the existance of a solution to particular wiring problems depends on the consistency of a set of simultaneous Boolean equations; A graph theoretic formulation which solves the problem for two competing interconnection nets by the generation of a tree of non-separating paths in the host network; and A planarity testing procedure which generates a planar drawing of a particular type of graph, a so-called permutation graph, in all cases where the graph is planar.</description><subject>ALGORITHMS</subject><subject>AUTOMATIC</subject><subject>Electrical and Electronic Equipment</subject><subject>GRAPHICS</subject><subject>GRAPHS</subject><subject>NETWORK FLOWS</subject><subject>PRINTED CIRCUITS</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>1973</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNrjZFB3zs8rKcpMKi3JzM8rVijJV0hUCMlIzS-qVMhPUwjPLEpMyszJLKnkYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4uBuamJiamhsYEpAENFyTj</recordid><startdate>19730101</startdate><enddate>19730101</enddate><creator>Cameron,Scott H</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>19730101</creationdate><title>Contributions to a Theory of Wirability</title><author>Cameron,Scott H</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_AD07544513</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>1973</creationdate><topic>ALGORITHMS</topic><topic>AUTOMATIC</topic><topic>Electrical and Electronic Equipment</topic><topic>GRAPHICS</topic><topic>GRAPHS</topic><topic>NETWORK FLOWS</topic><topic>PRINTED CIRCUITS</topic><toplevel>online_resources</toplevel><creatorcontrib>Cameron,Scott H</creatorcontrib><creatorcontrib>IIT RESEARCH INST CHICAGO ILL</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cameron,Scott H</au><aucorp>IIT RESEARCH INST CHICAGO ILL</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>Contributions to a Theory of Wirability</btitle><date>1973-01-01</date><risdate>1973</risdate><abstract>The report concerns the generation of printed circuit wiring patterns by efficient automatic procedures. The major topics treated in the report include the following: An algebraic formulation of the planar wiring problem based on a hexagonal, i.e., triply connected, host network in which the existance of a solution to particular wiring problems depends on the consistency of a set of simultaneous Boolean equations; A graph theoretic formulation which solves the problem for two competing interconnection nets by the generation of a tree of non-separating paths in the host network; and A planarity testing procedure which generates a planar drawing of a particular type of graph, a so-called permutation graph, in all cases where the graph is planar.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_dtic_stinet_AD0754451 |
source | DTIC Technical Reports |
subjects | ALGORITHMS AUTOMATIC Electrical and Electronic Equipment GRAPHICS GRAPHS NETWORK FLOWS PRINTED CIRCUITS |
title | Contributions to a Theory of Wirability |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T15%3A43%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=Contributions%20to%20a%20Theory%20of%20Wirability&rft.au=Cameron,Scott%20H&rft.aucorp=IIT%20RESEARCH%20INST%20CHICAGO%20ILL&rft.date=1973-01-01&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EAD0754451%3C/dtic_1RU%3E%3Cgrp_id%3Ecdi_FETCH-dtic_stinet_AD07544513%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |