A note on the derivation of maximal compatibility classes View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1966-06

AUTHORS

A. Grasselli

ABSTRACT

An algorithm for determining the maximal compatibility classes of a compatibility relation is proposed in this paper. The algorithm consists of a simple recursive procedure which operates on the compatibility table. The ALGOL implementation of the procedure is illustrated in an Appendix.

PAGES

165

Journal

TITLE

Calcolo

ISSUE

2

VOLUME

2

Author Affiliations

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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", 
    "author": [
      {
        "affiliation": {
          "alternateName": "Polytechnic University of Milan", 
          "id": "https://www.grid.ac/institutes/grid.4643.5", 
          "name": [
            "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Grasselli", 
        "givenName": "A.", 
        "id": "sg:person.014461304326.15", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014461304326.15"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1002/j.1538-7305.1962.tb00491.x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007797370"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/pgec.1965.264140", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061435373"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tec.1959.5222697", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061588198"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tec.1962.5219387", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061588444"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2310823", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069878799"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/00029890.1962.11989935", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1101508759"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2785673", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1102895271"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1966-06", 
    "datePublishedReg": "1966-06-01", 
    "description": "An algorithm for determining the maximal compatibility classes of a compatibility relation is proposed in this paper. The algorithm consists of a simple recursive procedure which operates on the compatibility table. The ALGOL implementation of the procedure is illustrated in an Appendix.", 
    "genre": "non_research_article", 
    "id": "sg:pub.10.1007/bf02575691", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1135974", 
        "issn": [
          "0008-0624", 
          "1126-5434"
        ], 
        "name": "Calcolo", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "2"
      }
    ], 
    "name": "A note on the derivation of maximal compatibility classes", 
    "pagination": "165", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "269c7622a144bcec3b08c42238a6810094bf2088a1c44e7387cbe985bf90b4a5"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02575691"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008104664"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02575691", 
      "https://app.dimensions.ai/details/publication/pub.1008104664"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T13:31", 
    "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/0000000370_0000000370/records_46757_00000000.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2FBF02575691"
  }
]
 

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/bf02575691'

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/bf02575691'

Turtle is a human-readable linked data format.

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

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

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


 

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

74 TRIPLES      20 PREDICATES      32 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02575691 schema:author N7a73cdb5432b443a889161a4ad42784d
2 schema:citation https://doi.org/10.1002/j.1538-7305.1962.tb00491.x
3 https://doi.org/10.1080/00029890.1962.11989935
4 https://doi.org/10.1109/pgec.1965.264140
5 https://doi.org/10.1109/tec.1959.5222697
6 https://doi.org/10.1109/tec.1962.5219387
7 https://doi.org/10.2307/2310823
8 https://doi.org/10.2307/2785673
9 schema:datePublished 1966-06
10 schema:datePublishedReg 1966-06-01
11 schema:description An algorithm for determining the maximal compatibility classes of a compatibility relation is proposed in this paper. The algorithm consists of a simple recursive procedure which operates on the compatibility table. The ALGOL implementation of the procedure is illustrated in an Appendix.
12 schema:genre non_research_article
13 schema:inLanguage en
14 schema:isAccessibleForFree false
15 schema:isPartOf Nb84eef6dd0cc4d6aa7f396125291f21d
16 Nd60cc9ca9fe14bb0a9c37177fe6044da
17 sg:journal.1135974
18 schema:name A note on the derivation of maximal compatibility classes
19 schema:pagination 165
20 schema:productId N9ea6a96c501d4ffd9338645354570180
21 Ncd19542c0a5b4e38826b901ed12f5e6c
22 Nfd202bee6eac42ca89d844a36968669f
23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008104664
24 https://doi.org/10.1007/bf02575691
25 schema:sdDatePublished 2019-04-11T13:31
26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
27 schema:sdPublisher N2313c604e9ba4f0e9604c2b6e40c4c1a
28 schema:url http://link.springer.com/10.1007%2FBF02575691
29 sgo:license sg:explorer/license/
30 sgo:sdDataset articles
31 rdf:type schema:ScholarlyArticle
32 N2313c604e9ba4f0e9604c2b6e40c4c1a schema:name Springer Nature - SN SciGraph project
33 rdf:type schema:Organization
34 N7a73cdb5432b443a889161a4ad42784d rdf:first sg:person.014461304326.15
35 rdf:rest rdf:nil
36 N9ea6a96c501d4ffd9338645354570180 schema:name readcube_id
37 schema:value 269c7622a144bcec3b08c42238a6810094bf2088a1c44e7387cbe985bf90b4a5
38 rdf:type schema:PropertyValue
39 Nb84eef6dd0cc4d6aa7f396125291f21d schema:issueNumber 2
40 rdf:type schema:PublicationIssue
41 Ncd19542c0a5b4e38826b901ed12f5e6c schema:name dimensions_id
42 schema:value pub.1008104664
43 rdf:type schema:PropertyValue
44 Nd60cc9ca9fe14bb0a9c37177fe6044da schema:volumeNumber 2
45 rdf:type schema:PublicationVolume
46 Nfd202bee6eac42ca89d844a36968669f schema:name doi
47 schema:value 10.1007/bf02575691
48 rdf:type schema:PropertyValue
49 sg:journal.1135974 schema:issn 0008-0624
50 1126-5434
51 schema:name Calcolo
52 rdf:type schema:Periodical
53 sg:person.014461304326.15 schema:affiliation https://www.grid.ac/institutes/grid.4643.5
54 schema:familyName Grasselli
55 schema:givenName A.
56 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014461304326.15
57 rdf:type schema:Person
58 https://doi.org/10.1002/j.1538-7305.1962.tb00491.x schema:sameAs https://app.dimensions.ai/details/publication/pub.1007797370
59 rdf:type schema:CreativeWork
60 https://doi.org/10.1080/00029890.1962.11989935 schema:sameAs https://app.dimensions.ai/details/publication/pub.1101508759
61 rdf:type schema:CreativeWork
62 https://doi.org/10.1109/pgec.1965.264140 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061435373
63 rdf:type schema:CreativeWork
64 https://doi.org/10.1109/tec.1959.5222697 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061588198
65 rdf:type schema:CreativeWork
66 https://doi.org/10.1109/tec.1962.5219387 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061588444
67 rdf:type schema:CreativeWork
68 https://doi.org/10.2307/2310823 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069878799
69 rdf:type schema:CreativeWork
70 https://doi.org/10.2307/2785673 schema:sameAs https://app.dimensions.ai/details/publication/pub.1102895271
71 rdf:type schema:CreativeWork
72 https://www.grid.ac/institutes/grid.4643.5 schema:alternateName Polytechnic University of Milan
73 schema:name Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy
74 rdf:type schema:Organization
 




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


...