A linear algorithm to find a rectangular dual of a planar triangulated graph View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1988-11

AUTHORS

Jayaram Bhasker, Sartaj Sahni

ABSTRACT

We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.

PAGES

247-278

Journal

TITLE

Algorithmica

ISSUE

1-4

VOLUME

3

Author Affiliations

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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": "University of Minnesota", 
          "id": "https://www.grid.ac/institutes/grid.17635.36", 
          "name": [
            "University of Minnesota, Minneapolis, Minnesota, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bhasker", 
        "givenName": "Jayaram", 
        "id": "sg:person.011702737575.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011702737575.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Minnesota", 
          "id": "https://www.grid.ac/institutes/grid.17635.36", 
          "name": [
            "University of Minnesota, Minneapolis, Minnesota, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sahni", 
        "givenName": "Sartaj", 
        "id": "sg:person.01105625042.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01105625042.70"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1002/net.3230170306", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036072538"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/dac.1984.1585872", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086237771"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1988-11", 
    "datePublishedReg": "1988-11-01", 
    "description": "We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01762117", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1047644", 
        "issn": [
          "0178-4617", 
          "1432-0541"
        ], 
        "name": "Algorithmica", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "3"
      }
    ], 
    "name": "A linear algorithm to find a rectangular dual of a planar triangulated graph", 
    "pagination": "247-278", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0ef489eac8df72309a67436f60246796dab96a41c22c62a7a4eb35596e6c1403"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01762117"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1003139574"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01762117", 
      "https://app.dimensions.ai/details/publication/pub.1003139574"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T09:57", 
    "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/0000000347_0000000347/records_89807_00000000.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF01762117"
  }
]
 

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

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

Turtle is a human-readable linked data format.

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

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

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


 

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

66 TRIPLES      20 PREDICATES      27 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01762117 schema:author N6ad14eb048734b1c9f3f28330933b8f6
2 schema:citation https://doi.org/10.1002/net.3230170306
3 https://doi.org/10.1109/dac.1984.1585872
4 schema:datePublished 1988-11
5 schema:datePublishedReg 1988-11-01
6 schema:description We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.
7 schema:genre research_article
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf Ndffe76314bb849c582fdecd1d200f417
11 Ne46f59bf2d574e1896100c4729b34338
12 sg:journal.1047644
13 schema:name A linear algorithm to find a rectangular dual of a planar triangulated graph
14 schema:pagination 247-278
15 schema:productId N5bf8971a8c464651b80d5d9a447fb1e9
16 Na27a85a6d86a4136bb87d7f2a1e0cc73
17 Nbc96cc3c7cf548488c6a8f78be47889d
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003139574
19 https://doi.org/10.1007/bf01762117
20 schema:sdDatePublished 2019-04-11T09:57
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N53276ee53184464c888cd7acf53eee71
23 schema:url http://link.springer.com/10.1007/BF01762117
24 sgo:license sg:explorer/license/
25 sgo:sdDataset articles
26 rdf:type schema:ScholarlyArticle
27 N53276ee53184464c888cd7acf53eee71 schema:name Springer Nature - SN SciGraph project
28 rdf:type schema:Organization
29 N5bf8971a8c464651b80d5d9a447fb1e9 schema:name dimensions_id
30 schema:value pub.1003139574
31 rdf:type schema:PropertyValue
32 N6ad14eb048734b1c9f3f28330933b8f6 rdf:first sg:person.011702737575.91
33 rdf:rest Nf9fdd7a640914732ac28cd185932c03e
34 Na27a85a6d86a4136bb87d7f2a1e0cc73 schema:name readcube_id
35 schema:value 0ef489eac8df72309a67436f60246796dab96a41c22c62a7a4eb35596e6c1403
36 rdf:type schema:PropertyValue
37 Nbc96cc3c7cf548488c6a8f78be47889d schema:name doi
38 schema:value 10.1007/bf01762117
39 rdf:type schema:PropertyValue
40 Ndffe76314bb849c582fdecd1d200f417 schema:issueNumber 1-4
41 rdf:type schema:PublicationIssue
42 Ne46f59bf2d574e1896100c4729b34338 schema:volumeNumber 3
43 rdf:type schema:PublicationVolume
44 Nf9fdd7a640914732ac28cd185932c03e rdf:first sg:person.01105625042.70
45 rdf:rest rdf:nil
46 sg:journal.1047644 schema:issn 0178-4617
47 1432-0541
48 schema:name Algorithmica
49 rdf:type schema:Periodical
50 sg:person.01105625042.70 schema:affiliation https://www.grid.ac/institutes/grid.17635.36
51 schema:familyName Sahni
52 schema:givenName Sartaj
53 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01105625042.70
54 rdf:type schema:Person
55 sg:person.011702737575.91 schema:affiliation https://www.grid.ac/institutes/grid.17635.36
56 schema:familyName Bhasker
57 schema:givenName Jayaram
58 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011702737575.91
59 rdf:type schema:Person
60 https://doi.org/10.1002/net.3230170306 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036072538
61 rdf:type schema:CreativeWork
62 https://doi.org/10.1109/dac.1984.1585872 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086237771
63 rdf:type schema:CreativeWork
64 https://www.grid.ac/institutes/grid.17635.36 schema:alternateName University of Minnesota
65 schema:name University of Minnesota, Minneapolis, Minnesota, USA
66 rdf:type schema:Organization
 




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


...