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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China", 
          "id": "http://www.grid.ac/institutes/grid.19188.39", 
          "name": [
            "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chen", 
        "givenName": "Ho-Lin", 
        "id": "sg:person.012704570265.60", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012704570265.60"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China", 
          "id": "http://www.grid.ac/institutes/grid.19188.39", 
          "name": [
            "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liao", 
        "givenName": "Chien-Chih", 
        "id": "sg:person.014703620455.71", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014703620455.71"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institute of Information Science, Academia Sinica, Taipei 115, Taiwan, Republic of China", 
          "id": "http://www.grid.ac/institutes/grid.506928.0", 
          "name": [
            "Institute of Information Science, Academia Sinica, Taipei 115, Taiwan, Republic of China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lu", 
        "givenName": "Hsueh-I", 
        "id": "sg:person.013345515575.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013345515575.46"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China", 
          "id": "http://www.grid.ac/institutes/grid.19188.39", 
          "name": [
            "Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan, Republic of China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yen", 
        "givenName": "Hsu-Chun", 
        "id": "sg:person.015077575457.09", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015077575457.09"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2002-11-08", 
    "datePublishedReg": "2002-11-08", 
    "description": "Orderly spanning trees seem to have the potential of becoming a new and promising technique capable of unifying known results as well as deriving new results in graph drawing. Our exploration in this paper provides new evidence to demonstrate such a potential. Two applications of the orderly spanning trees of plane graphs are investigated. Our first application deals with Podevs drawing, i.e., planar orthogonal drawing with equal vertex size, introduced by F\u00f6\u00dfmeier and Kaufmann. Based upon orderly spanning trees, we give an algorithm that produces a Podevs drawing with half-perimeter no more than [3n/2] + 1 and at most one bend per edge for any n-node plane graph with maximal degree \u0394, a notable improvement over the existing results in the literature in terms of the size of the drawing area. The second application is an alternative proof for the sufficient and necessary condition for a graph to admit a rectangular dual, i.e., a floor-plan using only rectangles.", 
    "editor": [
      {
        "familyName": "Goodrich", 
        "givenName": "Michael T.", 
        "type": "Person"
      }, 
      {
        "familyName": "Kobourov", 
        "givenName": "Stephen G.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-36151-0_31", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-00158-4", 
        "978-3-540-36151-0"
      ], 
      "name": "Graph Drawing", 
      "type": "Book"
    }, 
    "keywords": [
      "graph drawing", 
      "spanning tree", 
      "plane graph", 
      "orderly spanning trees", 
      "maximal degree \u0394", 
      "degree \u0394", 
      "only rectangles", 
      "new results", 
      "vertex size", 
      "alternative proof", 
      "necessary condition", 
      "graph", 
      "second application", 
      "application deals", 
      "first application deals", 
      "applications", 
      "drawing area", 
      "algorithm", 
      "rectangle", 
      "proof", 
      "promising technique", 
      "planar", 
      "edge", 
      "results", 
      "terms", 
      "notable improvement", 
      "trees", 
      "technique", 
      "size", 
      "Kaufmann", 
      "bend", 
      "conditions", 
      "potential", 
      "drawings", 
      "deal", 
      "literature", 
      "exploration", 
      "improvement", 
      "area", 
      "paper", 
      "evidence", 
      "new evidence"
    ], 
    "name": "Some Applications of Orderly Spanning Trees in Graph Drawing", 
    "pagination": "332-343", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1014210834"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-36151-0_31"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-36151-0_31", 
      "https://app.dimensions.ai/details/publication/pub.1014210834"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:41", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_203.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-36151-0_31"
  }
]

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

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

131 TRIPLES      23 PREDICATES      67 URIs      60 LITERALS      7 BLANK NODES