Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs View Full Text


Ontology type: schema:ScholarlyArticle     

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA (e-mail: liangy@cvax.ipfw.indiana.edu), US", 
          "id": "http://www.grid.ac/institutes/grid.503846.c", 
          "name": [
            "Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA (e-mail: liangy@cvax.ipfw.indiana.edu), US"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Daniel Liang", 
        "givenName": "Y.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi 621, Taiwan, Republic of China (e-mail: mschang@cs.ccu.edu.tw), TW", 
          "id": "http://www.grid.ac/institutes/grid.412047.4", 
          "name": [
            "Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi 621, Taiwan, Republic of China (e-mail: mschang@cs.ccu.edu.tw), TW"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chang", 
        "givenName": "Maw-Shang", 
        "id": "sg:person.013174232477.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013174232477.45"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1997-05", 
    "datePublishedReg": "1997-05-01", 
    "description": "Abstract.Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and convex bipartite graphs are presented.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s002360050088", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1133515", 
        "issn": [
          "0001-5903", 
          "1432-0525"
        ], 
        "name": "Acta Informatica", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "34"
      }
    ], 
    "keywords": [
      "cocomparability graphs", 
      "polynomial-time algorithm", 
      "convex bipartite graphs", 
      "bipartite graphs", 
      "Feedback Vertex Set", 
      "minimum feedback vertex sets", 
      "feedback vertex", 
      "graph", 
      "vertex set", 
      "algorithm", 
      "set", 
      "vertices", 
      "problem"
    ], 
    "name": "Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs", 
    "pagination": "337-346", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1041849641"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s002360050088"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s002360050088", 
      "https://app.dimensions.ai/details/publication/pub.1041849641"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2021-11-01T18:02", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/article/article_285.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s002360050088"
  }
]
 

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

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

Turtle is a human-readable linked data format.

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

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

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


 

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

88 TRIPLES      21 PREDICATES      41 URIs      31 LITERALS      6 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s002360050088 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0803
4 anzsrc-for:0804
5 schema:author N7eb0821a1c59482c80150ad0016bbad0
6 schema:datePublished 1997-05
7 schema:datePublishedReg 1997-05-01
8 schema:description Abstract.Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and convex bipartite graphs are presented.
9 schema:genre article
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N16676e818fc14de4befd79ef782c7f33
13 Nc9a21fb2b85b48f1a80e7f9a26aa6110
14 sg:journal.1133515
15 schema:keywords Feedback Vertex Set
16 algorithm
17 bipartite graphs
18 cocomparability graphs
19 convex bipartite graphs
20 feedback vertex
21 graph
22 minimum feedback vertex sets
23 polynomial-time algorithm
24 problem
25 set
26 vertex set
27 vertices
28 schema:name Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs
29 schema:pagination 337-346
30 schema:productId N425eaf7e9d924202a2c4e8dc4afdff05
31 Nab80568d79254675bfe95f31c87d6e9e
32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041849641
33 https://doi.org/10.1007/s002360050088
34 schema:sdDatePublished 2021-11-01T18:02
35 schema:sdLicense https://scigraph.springernature.com/explorer/license/
36 schema:sdPublisher Ne6130513881d4c4596c7852ff0690266
37 schema:url https://doi.org/10.1007/s002360050088
38 sgo:license sg:explorer/license/
39 sgo:sdDataset articles
40 rdf:type schema:ScholarlyArticle
41 N16676e818fc14de4befd79ef782c7f33 schema:volumeNumber 34
42 rdf:type schema:PublicationVolume
43 N1ac272a4fd124cbaaf1017095216b8e7 rdf:first sg:person.013174232477.45
44 rdf:rest rdf:nil
45 N425eaf7e9d924202a2c4e8dc4afdff05 schema:name dimensions_id
46 schema:value pub.1041849641
47 rdf:type schema:PropertyValue
48 N7eb0821a1c59482c80150ad0016bbad0 rdf:first Nf66e9ebc268d4a3286c5e1146e6eb76b
49 rdf:rest N1ac272a4fd124cbaaf1017095216b8e7
50 Nab80568d79254675bfe95f31c87d6e9e schema:name doi
51 schema:value 10.1007/s002360050088
52 rdf:type schema:PropertyValue
53 Nc9a21fb2b85b48f1a80e7f9a26aa6110 schema:issueNumber 5
54 rdf:type schema:PublicationIssue
55 Ne6130513881d4c4596c7852ff0690266 schema:name Springer Nature - SN SciGraph project
56 rdf:type schema:Organization
57 Nf66e9ebc268d4a3286c5e1146e6eb76b schema:affiliation grid-institutes:grid.503846.c
58 schema:familyName Daniel Liang
59 schema:givenName Y.
60 rdf:type schema:Person
61 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
62 schema:name Information and Computing Sciences
63 rdf:type schema:DefinedTerm
64 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
65 schema:name Computation Theory and Mathematics
66 rdf:type schema:DefinedTerm
67 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
68 schema:name Computer Software
69 rdf:type schema:DefinedTerm
70 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
71 schema:name Data Format
72 rdf:type schema:DefinedTerm
73 sg:journal.1133515 schema:issn 0001-5903
74 1432-0525
75 schema:name Acta Informatica
76 schema:publisher Springer Nature
77 rdf:type schema:Periodical
78 sg:person.013174232477.45 schema:affiliation grid-institutes:grid.412047.4
79 schema:familyName Chang
80 schema:givenName Maw-Shang
81 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013174232477.45
82 rdf:type schema:Person
83 grid-institutes:grid.412047.4 schema:alternateName Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi 621, Taiwan, Republic of China (e-mail: mschang@cs.ccu.edu.tw), TW
84 schema:name Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi 621, Taiwan, Republic of China (e-mail: mschang@cs.ccu.edu.tw), TW
85 rdf:type schema:Organization
86 grid-institutes:grid.503846.c schema:alternateName Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA (e-mail: liangy@cvax.ipfw.indiana.edu), US
87 schema:name Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA (e-mail: liangy@cvax.ipfw.indiana.edu), US
88 rdf:type schema:Organization
 




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


...