A weighted graph embedding technique and its application to automatic circuit Layout View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1971-03

AUTHORS

G. Levi, F. Luccio

ABSTRACT

The extension of a known technique for graph embedding is presented for the solution of a class of problems arising in computer aided circuit layout. The embedding of a weighted graphX onto another weighted graphY is studied, with concurrent minimization of a cost function whose value depends on node and are associations. The embedding process is based on a partially enumerative covering technique on a Node Correspondence Table. Two applications are described, namely the placement of electrical components on a card in printed circuit design, and the allocation of a cards in a rack for the optimal design of backboard connections. An example of this latter problem is discussed in detail. More... »

PAGES

49-60

Journal

TITLE

Calcolo

ISSUE

1-2

VOLUME

8

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf02575573

DOI

http://dx.doi.org/10.1007/bf02575573

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1041824780


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "National Research Council", 
          "id": "https://www.grid.ac/institutes/grid.5326.2", 
          "name": [
            "Istituto per l'Elaborazione della Informaziene, C.N.R., Pisa, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Levi", 
        "givenName": "G.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "National Research Council", 
          "id": "https://www.grid.ac/institutes/grid.5326.2", 
          "name": [
            "Istituto per l'Elaborazione della Informaziene, C.N.R., Pisa, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Luccio", 
        "givenName": "F.", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/321556.321562", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003980246"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1971-03", 
    "datePublishedReg": "1971-03-01", 
    "description": "The extension of a known technique for graph embedding is presented for the solution of a class of problems arising in computer aided circuit layout. The embedding of a weighted graphX onto another weighted graphY is studied, with concurrent minimization of a cost function whose value depends on node and are associations. The embedding process is based on a partially enumerative covering technique on a Node Correspondence Table. Two applications are described, namely the placement of electrical components on a card in printed circuit design, and the allocation of a cards in a rack for the optimal design of backboard connections. An example of this latter problem is discussed in detail.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf02575573", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1135974", 
        "issn": [
          "0008-0624", 
          "1126-5434"
        ], 
        "name": "Calcolo", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "8"
      }
    ], 
    "name": "A weighted graph embedding technique and its application to automatic circuit Layout", 
    "pagination": "49-60", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "c73bf16aefee7855c8886aeecc4da40f0ae240a499028f27c41f368d10a42d97"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02575573"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1041824780"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02575573", 
      "https://app.dimensions.ai/details/publication/pub.1041824780"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T14:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8663_00000507.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2FBF02575573"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf02575573'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf02575573'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02575573'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02575573'


 

This table displays all metadata directly associated to this object as RDF triples.

69 TRIPLES      21 PREDICATES      28 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02575573 schema:about anzsrc-for:08
2 anzsrc-for:0803
3 schema:author N7c26649d08a148cfb2af565b50ae9fbe
4 schema:citation https://doi.org/10.1145/321556.321562
5 schema:datePublished 1971-03
6 schema:datePublishedReg 1971-03-01
7 schema:description The extension of a known technique for graph embedding is presented for the solution of a class of problems arising in computer aided circuit layout. The embedding of a weighted graphX onto another weighted graphY is studied, with concurrent minimization of a cost function whose value depends on node and are associations. The embedding process is based on a partially enumerative covering technique on a Node Correspondence Table. Two applications are described, namely the placement of electrical components on a card in printed circuit design, and the allocation of a cards in a rack for the optimal design of backboard connections. An example of this latter problem is discussed in detail.
8 schema:genre research_article
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nc923410b44054ac7a8b6b6442e576fe7
12 Nd7a8097374b144939794b1192ecc1b6e
13 sg:journal.1135974
14 schema:name A weighted graph embedding technique and its application to automatic circuit Layout
15 schema:pagination 49-60
16 schema:productId N5c4f6b6dee054e6cb55b9752d7a0d11c
17 N7f75386ae67449d383905d501b3add8c
18 Nf2ce6b46daf646b79ff4acd93510057b
19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041824780
20 https://doi.org/10.1007/bf02575573
21 schema:sdDatePublished 2019-04-10T14:59
22 schema:sdLicense https://scigraph.springernature.com/explorer/license/
23 schema:sdPublisher N9e7b9b0b7bf7473fbdd25e55600fb892
24 schema:url http://link.springer.com/10.1007%2FBF02575573
25 sgo:license sg:explorer/license/
26 sgo:sdDataset articles
27 rdf:type schema:ScholarlyArticle
28 N419265379c104fc8867ec0407bd737c2 rdf:first N9c2f479e2cd144b3a93432c5793a8e71
29 rdf:rest rdf:nil
30 N5c4f6b6dee054e6cb55b9752d7a0d11c schema:name readcube_id
31 schema:value c73bf16aefee7855c8886aeecc4da40f0ae240a499028f27c41f368d10a42d97
32 rdf:type schema:PropertyValue
33 N7c26649d08a148cfb2af565b50ae9fbe rdf:first Nd2df3ddfc60649dfab794ba578153baa
34 rdf:rest N419265379c104fc8867ec0407bd737c2
35 N7f75386ae67449d383905d501b3add8c schema:name dimensions_id
36 schema:value pub.1041824780
37 rdf:type schema:PropertyValue
38 N9c2f479e2cd144b3a93432c5793a8e71 schema:affiliation https://www.grid.ac/institutes/grid.5326.2
39 schema:familyName Luccio
40 schema:givenName F.
41 rdf:type schema:Person
42 N9e7b9b0b7bf7473fbdd25e55600fb892 schema:name Springer Nature - SN SciGraph project
43 rdf:type schema:Organization
44 Nc923410b44054ac7a8b6b6442e576fe7 schema:volumeNumber 8
45 rdf:type schema:PublicationVolume
46 Nd2df3ddfc60649dfab794ba578153baa schema:affiliation https://www.grid.ac/institutes/grid.5326.2
47 schema:familyName Levi
48 schema:givenName G.
49 rdf:type schema:Person
50 Nd7a8097374b144939794b1192ecc1b6e schema:issueNumber 1-2
51 rdf:type schema:PublicationIssue
52 Nf2ce6b46daf646b79ff4acd93510057b schema:name doi
53 schema:value 10.1007/bf02575573
54 rdf:type schema:PropertyValue
55 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
56 schema:name Information and Computing Sciences
57 rdf:type schema:DefinedTerm
58 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
59 schema:name Computer Software
60 rdf:type schema:DefinedTerm
61 sg:journal.1135974 schema:issn 0008-0624
62 1126-5434
63 schema:name Calcolo
64 rdf:type schema:Periodical
65 https://doi.org/10.1145/321556.321562 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003980246
66 rdf:type schema:CreativeWork
67 https://www.grid.ac/institutes/grid.5326.2 schema:alternateName National Research Council
68 schema:name Istituto per l'Elaborazione della Informaziene, C.N.R., Pisa, Italy
69 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...