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": "Computer Science Department, University of Alabama in Huntsville, 35899, Huntsville, AL, USA", 
          "id": "http://www.grid.ac/institutes/grid.265893.3", 
          "name": [
            "Computer Science Department, University of Alabama in Huntsville, 35899, Huntsville, AL, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zhang", 
        "givenName": "Huaming", 
        "id": "sg:person.012041227127.88", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012041227127.88"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/3-540-36379-3_4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003004205", 
          "https://doi.org/10.1007/3-540-36379-3_4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/pl00009290", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040398436", 
          "https://doi.org/10.1007/pl00009290"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00353652", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015637021", 
          "https://doi.org/10.1007/bf00353652"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-36494-3_44", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009890571", 
          "https://doi.org/10.1007/3-540-36494-3_44"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11618058_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014203093", 
          "https://doi.org/10.1007/11618058_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-77537-9_22", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050806102", 
          "https://doi.org/10.1007/978-3-540-77537-9_22"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2008-08-15", 
    "datePublishedReg": "2008-08-15", 
    "description": "We study the problem of transforming plane triangulations into irreducible triangulations, which are plane graphs with a quadrangular exterior face, triangular interior faces and no separating triangles. Our linear time transformation reveals important relations between the minimum Schnyder\u2019s realizers of plane triangulations (Bonichon et al., Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol.\u00a02607, pp.\u00a0499\u2013510, Springer, Berlin, 2003; Research Report RR-1279-02, LaBRI, University of Bordeaux, France; Brehm, Diploma thesis, FB Mathematik und Informatik, Freie Universit\u00e4t Berlin, 2000) and the transversal structures of irreducible triangulations (Fusy, Proceedings of 13th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol.\u00a03843, pp.\u00a0177\u2013188, Springer, Berlin, 2005; He, SIAM J.\u00a0Comput. 22:1218\u20131226, 1993). The transformation morphs a 3-connected plane graph into an internally 4-connected plane graph. Therefore some of the graph algorithms designed specifically for 4-connected plane graphs can be applied to 3-connected plane graphs indirectly. As an example of such applications, we present a linear time algorithm that produces a planar polyline drawing for a plane graph with n vertices in a grid of size bounded by W\u00d7H, where \n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$W\\leq\\lfloor\\frac{2n-2}{3}\\rfloor$\\end{document}\n, and \n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$W+H\\leq\\lfloor \\frac{4n-4}{3}\\rfloor$\\end{document}\n. It uses at most \n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\lfloor\\frac{2n-5}{3}\\rfloor$\\end{document} \nbends, and each edge uses at most one bend. Our algorithm is area optimal. Compared with the existing area optimal polyline drawing algorithm proposed in Bonichon et\u00a0al. (Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.\u00a02573, pp.\u00a035\u201346, Springer, Berlin, 2002), our algorithm uses a smaller number of bends. Their bend bound is (n\u22122).", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s00453-008-9215-x", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1047644", 
        "issn": [
          "0178-4617", 
          "1432-0541"
        ], 
        "name": "Algorithmica", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "57"
      }
    ], 
    "keywords": [
      "plane graph", 
      "irreducible triangulations", 
      "Planar Polyline Drawings", 
      "quadrangular exterior face", 
      "triangular interior faces", 
      "linear-time transformation", 
      "grid of size", 
      "linear time algorithm", 
      "plane triangulations", 
      "polyline drawings", 
      "Schnyder\u2019s realizers", 
      "separating triangles", 
      "time transformation", 
      "graph algorithms", 
      "transversal structure", 
      "graph", 
      "time algorithm", 
      "graph transformation", 
      "interior faces", 
      "algorithm", 
      "important relations", 
      "triangulation", 
      "such applications", 
      "polylines", 
      "exterior face", 
      "vertices", 
      "small number", 
      "realizers", 
      "transformation", 
      "grid", 
      "problem", 
      "bend", 
      "triangle", 
      "edge", 
      "applications", 
      "et", 
      "structure", 
      "number", 
      "al", 
      "relation", 
      "size", 
      "face", 
      "drawings", 
      "example", 
      "area"
    ], 
    "name": "Planar Polyline Drawings via Graph Transformations", 
    "pagination": "381-397", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1032949578"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00453-008-9215-x"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00453-008-9215-x", 
      "https://app.dimensions.ai/details/publication/pub.1032949578"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:24", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_452.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s00453-008-9215-x"
  }
]

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.

127 TRIPLES      22 PREDICATES      76 URIs      62 LITERALS      6 BLANK NODES