An Application of Well-Orderly Trees in Graph Drawing View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2006

AUTHORS

Huaming Zhang , Xin He

ABSTRACT

Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n–1)/5, by using well-orderly trees.

PAGES

458-467

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11618058_41

DOI

http://dx.doi.org/10.1007/11618058_41

DIMENSIONS

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


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/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 Computer Science, University of Alabama in Huntsville, 35899, Huntsville, AL, USA", 
          "id": "http://www.grid.ac/institutes/grid.265893.3", 
          "name": [
            "Department of Computer Science, 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"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, SUNY at Buffalo, 14260, Buffalo, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.273335.3", 
          "name": [
            "Department of Computer Science and Engineering, SUNY at Buffalo, 14260, Buffalo, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "He", 
        "givenName": "Xin", 
        "id": "sg:person.011352641523.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011352641523.42"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2006", 
    "datePublishedReg": "2006-01-01", 
    "description": "Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n\u20131)/5, by using well-orderly trees.", 
    "editor": [
      {
        "familyName": "Healy", 
        "givenName": "Patrick", 
        "type": "Person"
      }, 
      {
        "familyName": "Nikolov", 
        "givenName": "Nikola S.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11618058_41", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-31425-7", 
        "978-3-540-31667-1"
      ], 
      "name": "Graph Drawing", 
      "type": "Book"
    }, 
    "keywords": [
      "powerful technique", 
      "generation", 
      "height", 
      "applications", 
      "technique", 
      "new results", 
      "graph generation", 
      "drawings", 
      "potential", 
      "results", 
      "graph encoding", 
      "graph enumeration", 
      "graph drawing", 
      "trees", 
      "graph", 
      "encoding", 
      "representation", 
      "plane graph", 
      "enumeration", 
      "visibility representation", 
      "paper", 
      "orderly trees"
    ], 
    "name": "An Application of Well-Orderly Trees in Graph Drawing", 
    "pagination": "458-467", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1020730033"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11618058_41"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11618058_41", 
      "https://app.dimensions.ai/details/publication/pub.1020730033"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:02", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_267.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11618058_41"
  }
]
 

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/11618058_41'

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/11618058_41'

Turtle is a human-readable linked data format.

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

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

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


 

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

97 TRIPLES      23 PREDICATES      48 URIs      41 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11618058_41 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N181ad95c7a83480ab8ba8a35f813664d
4 schema:datePublished 2006
5 schema:datePublishedReg 2006-01-01
6 schema:description Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n–1)/5, by using well-orderly trees.
7 schema:editor N583fe6579efd4eeb97de456c296ef946
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Ne3db111068fc48ae940c8c89aa754007
12 schema:keywords applications
13 drawings
14 encoding
15 enumeration
16 generation
17 graph
18 graph drawing
19 graph encoding
20 graph enumeration
21 graph generation
22 height
23 new results
24 orderly trees
25 paper
26 plane graph
27 potential
28 powerful technique
29 representation
30 results
31 technique
32 trees
33 visibility representation
34 schema:name An Application of Well-Orderly Trees in Graph Drawing
35 schema:pagination 458-467
36 schema:productId N5f21a21fcb664733b3c493c4fa044be3
37 Nf017339678c54d47881484208908a650
38 schema:publisher N2b4f0ba1e5664427ba6109987022a555
39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020730033
40 https://doi.org/10.1007/11618058_41
41 schema:sdDatePublished 2021-12-01T20:02
42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
43 schema:sdPublisher N6d8acfcdb744415db06c0a47f7c36f77
44 schema:url https://doi.org/10.1007/11618058_41
45 sgo:license sg:explorer/license/
46 sgo:sdDataset chapters
47 rdf:type schema:Chapter
48 N0ae50957d42f4db0b369ae3b065ff6c0 schema:familyName Healy
49 schema:givenName Patrick
50 rdf:type schema:Person
51 N181ad95c7a83480ab8ba8a35f813664d rdf:first sg:person.012041227127.88
52 rdf:rest N59ec83f8bf764e6380e12fd6416398be
53 N2b4f0ba1e5664427ba6109987022a555 schema:name Springer Nature
54 rdf:type schema:Organisation
55 N583fe6579efd4eeb97de456c296ef946 rdf:first N0ae50957d42f4db0b369ae3b065ff6c0
56 rdf:rest N6cec1a14bcfc4d97a136f12bade90d25
57 N59ec83f8bf764e6380e12fd6416398be rdf:first sg:person.011352641523.42
58 rdf:rest rdf:nil
59 N5ac7a40cfe1e4f61a0bca4830555a045 schema:familyName Nikolov
60 schema:givenName Nikola S.
61 rdf:type schema:Person
62 N5f21a21fcb664733b3c493c4fa044be3 schema:name doi
63 schema:value 10.1007/11618058_41
64 rdf:type schema:PropertyValue
65 N6cec1a14bcfc4d97a136f12bade90d25 rdf:first N5ac7a40cfe1e4f61a0bca4830555a045
66 rdf:rest rdf:nil
67 N6d8acfcdb744415db06c0a47f7c36f77 schema:name Springer Nature - SN SciGraph project
68 rdf:type schema:Organization
69 Ne3db111068fc48ae940c8c89aa754007 schema:isbn 978-3-540-31425-7
70 978-3-540-31667-1
71 schema:name Graph Drawing
72 rdf:type schema:Book
73 Nf017339678c54d47881484208908a650 schema:name dimensions_id
74 schema:value pub.1020730033
75 rdf:type schema:PropertyValue
76 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
77 schema:name Information and Computing Sciences
78 rdf:type schema:DefinedTerm
79 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
80 schema:name Computation Theory and Mathematics
81 rdf:type schema:DefinedTerm
82 sg:person.011352641523.42 schema:affiliation grid-institutes:grid.273335.3
83 schema:familyName He
84 schema:givenName Xin
85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011352641523.42
86 rdf:type schema:Person
87 sg:person.012041227127.88 schema:affiliation grid-institutes:grid.265893.3
88 schema:familyName Zhang
89 schema:givenName Huaming
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012041227127.88
91 rdf:type schema:Person
92 grid-institutes:grid.265893.3 schema:alternateName Department of Computer Science, University of Alabama in Huntsville, 35899, Huntsville, AL, USA
93 schema:name Department of Computer Science, University of Alabama in Huntsville, 35899, Huntsville, AL, USA
94 rdf:type schema:Organization
95 grid-institutes:grid.273335.3 schema:alternateName Department of Computer Science and Engineering, SUNY at Buffalo, 14260, Buffalo, NY, USA
96 schema:name Department of Computer Science and Engineering, SUNY at Buffalo, 14260, Buffalo, NY, USA
97 rdf:type schema:Organization
 




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


...