Search for a unique incidence matrix of a graph View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1974-06

AUTHORS

Andrzej Proskurowski

ABSTRACT

This work deals with the problem of isomorphism of simple graphs without selfloops and gives a proposal for a canonical representation of graphs and an efficient deterministic procedure to find this representation. The article is disposed as follows: Section 1 defines the topological and computational language used and presents the isomorphism problem. The main results of the research are given in section 2, followed by the ALGOL-version of the algorithm and an analysis of its efficiency in section 3. More... »

PAGES

209-226

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Royal Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.5037.1", 
          "name": [
            "Telecommunication Theory, Royal Institute of Technology, Stockholm, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Proskurowski", 
        "givenName": "Andrzej", 
        "id": "sg:person.013546165773.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013546165773.39"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/321556.321562", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003980246"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/363872.363899", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015364039"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01932810", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038425365", 
          "https://doi.org/10.1007/bf01932810"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01932810", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038425365", 
          "https://doi.org/10.1007/bf01932810"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/321765.321766", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050081283"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tct.1966.1082573", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061578258"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0201010", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062841173"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1974-06", 
    "datePublishedReg": "1974-06-01", 
    "description": "This work deals with the problem of isomorphism of simple graphs without selfloops and gives a proposal for a canonical representation of graphs and an efficient deterministic procedure to find this representation. The article is disposed as follows: Section 1 defines the topological and computational language used and presents the isomorphism problem. The main results of the research are given in section 2, followed by the ALGOL-version of the algorithm and an analysis of its efficiency in section 3.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01932948", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136252", 
        "issn": [
          "0006-3835", 
          "1572-9125"
        ], 
        "name": "BIT Numerical Mathematics", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "14"
      }
    ], 
    "name": "Search for a unique incidence matrix of a graph", 
    "pagination": "209-226", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "e5587c92e9f8c2ce8133d406963e998497a0d1300fa393e11a75e2eb6f964e57"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01932948"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1048143115"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01932948", 
      "https://app.dimensions.ai/details/publication/pub.1048143115"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T11:10", 
    "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/0000000353_0000000353/records_45345_00000000.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF01932948"
  }
]
 

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

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

Turtle is a human-readable linked data format.

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

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

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


 

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

80 TRIPLES      21 PREDICATES      33 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01932948 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author N6575cdda3db3484ab1e691bcec75dc4a
4 schema:citation sg:pub.10.1007/bf01932810
5 https://doi.org/10.1109/tct.1966.1082573
6 https://doi.org/10.1137/0201010
7 https://doi.org/10.1145/321556.321562
8 https://doi.org/10.1145/321765.321766
9 https://doi.org/10.1145/363872.363899
10 schema:datePublished 1974-06
11 schema:datePublishedReg 1974-06-01
12 schema:description This work deals with the problem of isomorphism of simple graphs without selfloops and gives a proposal for a canonical representation of graphs and an efficient deterministic procedure to find this representation. The article is disposed as follows: Section 1 defines the topological and computational language used and presents the isomorphism problem. The main results of the research are given in section 2, followed by the ALGOL-version of the algorithm and an analysis of its efficiency in section 3.
13 schema:genre research_article
14 schema:inLanguage en
15 schema:isAccessibleForFree false
16 schema:isPartOf N3b0585ca121a41548f7d4f849eaf7acd
17 Nc221d8735247409bb5b459917a55e06b
18 sg:journal.1136252
19 schema:name Search for a unique incidence matrix of a graph
20 schema:pagination 209-226
21 schema:productId N005f380872fd4d52bf84b2e7b13b7cb1
22 N449591cadaf843f59bfc243e6d8cdb3f
23 Ncf596281d90f4319866362d07d3fc1a7
24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048143115
25 https://doi.org/10.1007/bf01932948
26 schema:sdDatePublished 2019-04-11T11:10
27 schema:sdLicense https://scigraph.springernature.com/explorer/license/
28 schema:sdPublisher N25846260eb324375a4e4ce4a1696e3e5
29 schema:url http://link.springer.com/10.1007/BF01932948
30 sgo:license sg:explorer/license/
31 sgo:sdDataset articles
32 rdf:type schema:ScholarlyArticle
33 N005f380872fd4d52bf84b2e7b13b7cb1 schema:name doi
34 schema:value 10.1007/bf01932948
35 rdf:type schema:PropertyValue
36 N25846260eb324375a4e4ce4a1696e3e5 schema:name Springer Nature - SN SciGraph project
37 rdf:type schema:Organization
38 N3b0585ca121a41548f7d4f849eaf7acd schema:issueNumber 2
39 rdf:type schema:PublicationIssue
40 N449591cadaf843f59bfc243e6d8cdb3f schema:name readcube_id
41 schema:value e5587c92e9f8c2ce8133d406963e998497a0d1300fa393e11a75e2eb6f964e57
42 rdf:type schema:PropertyValue
43 N6575cdda3db3484ab1e691bcec75dc4a rdf:first sg:person.013546165773.39
44 rdf:rest rdf:nil
45 Nc221d8735247409bb5b459917a55e06b schema:volumeNumber 14
46 rdf:type schema:PublicationVolume
47 Ncf596281d90f4319866362d07d3fc1a7 schema:name dimensions_id
48 schema:value pub.1048143115
49 rdf:type schema:PropertyValue
50 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
51 schema:name Mathematical Sciences
52 rdf:type schema:DefinedTerm
53 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
54 schema:name Pure Mathematics
55 rdf:type schema:DefinedTerm
56 sg:journal.1136252 schema:issn 0006-3835
57 1572-9125
58 schema:name BIT Numerical Mathematics
59 rdf:type schema:Periodical
60 sg:person.013546165773.39 schema:affiliation https://www.grid.ac/institutes/grid.5037.1
61 schema:familyName Proskurowski
62 schema:givenName Andrzej
63 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013546165773.39
64 rdf:type schema:Person
65 sg:pub.10.1007/bf01932810 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038425365
66 https://doi.org/10.1007/bf01932810
67 rdf:type schema:CreativeWork
68 https://doi.org/10.1109/tct.1966.1082573 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061578258
69 rdf:type schema:CreativeWork
70 https://doi.org/10.1137/0201010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841173
71 rdf:type schema:CreativeWork
72 https://doi.org/10.1145/321556.321562 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003980246
73 rdf:type schema:CreativeWork
74 https://doi.org/10.1145/321765.321766 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050081283
75 rdf:type schema:CreativeWork
76 https://doi.org/10.1145/363872.363899 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015364039
77 rdf:type schema:CreativeWork
78 https://www.grid.ac/institutes/grid.5037.1 schema:alternateName Royal Institute of Technology
79 schema:name Telecommunication Theory, Royal Institute of Technology, Stockholm, Sweden
80 rdf:type schema:Organization
 




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


...