Weighted irredundance of interval graphs View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1994

AUTHORS

C. Pandu Rangan , Maw-Shang Chang

ABSTRACT

In this paper, an O(n3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.

PAGES

567-574

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-58325-4_224

DOI

http://dx.doi.org/10.1007/3-540-58325-4_224

DIMENSIONS

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


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": "Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India", 
          "id": "http://www.grid.ac/institutes/grid.417969.4", 
          "name": [
            "Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pandu Rangan", 
        "givenName": "C.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, Chiayi, 621, Taiwan, China", 
          "id": "http://www.grid.ac/institutes/grid.412047.4", 
          "name": [
            "Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, Chiayi, 621, Taiwan, China"
          ], 
          "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": "1994", 
    "datePublishedReg": "1994-01-01", 
    "description": "In this paper, an O(n3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.", 
    "editor": [
      {
        "familyName": "Du", 
        "givenName": "Ding-Zhu", 
        "type": "Person"
      }, 
      {
        "familyName": "Zhang", 
        "givenName": "Xiang-Sun", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-58325-4_224", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-58325-7", 
        "978-3-540-48653-4"
      ], 
      "name": "Algorithms and Computation", 
      "type": "Book"
    }, 
    "keywords": [
      "interval graphs", 
      "set", 
      "graph", 
      "maximal irredundant sets", 
      "irredundant set", 
      "algorithm", 
      "irredundance", 
      "paper", 
      "Weighted irredundance"
    ], 
    "name": "Weighted irredundance of interval graphs", 
    "pagination": "567-574", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1013834005"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-58325-4_224"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-58325-4_224", 
      "https://app.dimensions.ai/details/publication/pub.1013834005"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T19:01", 
    "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/chapter/chapter_47.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-58325-4_224"
  }
]
 

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/3-540-58325-4_224'

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/3-540-58325-4_224'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-58325-4_224'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-58325-4_224'


 

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

75 TRIPLES      22 PREDICATES      33 URIs      28 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-58325-4_224 schema:author Nbe031f6211ad484583b06e6ffe21d1a7
2 schema:datePublished 1994
3 schema:datePublishedReg 1994-01-01
4 schema:description In this paper, an O(n3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.
5 schema:editor N3bfe4efe2ac94444ac69252f984dd0e3
6 schema:genre chapter
7 schema:inLanguage en
8 schema:isAccessibleForFree false
9 schema:isPartOf N0f821e3d6b4748b1bd8eafd6366e1dd9
10 schema:keywords Weighted irredundance
11 algorithm
12 graph
13 interval graphs
14 irredundance
15 irredundant set
16 maximal irredundant sets
17 paper
18 set
19 schema:name Weighted irredundance of interval graphs
20 schema:pagination 567-574
21 schema:productId N0fb27228c01749f1a8d6bc801817b50c
22 N55245007c13245f0b33798deb76c921e
23 schema:publisher N96cefb05a6c94ec2985a84ffe5f5f272
24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013834005
25 https://doi.org/10.1007/3-540-58325-4_224
26 schema:sdDatePublished 2021-11-01T19:01
27 schema:sdLicense https://scigraph.springernature.com/explorer/license/
28 schema:sdPublisher N5e972db1eec34f6fb12a3f3c65fbe114
29 schema:url https://doi.org/10.1007/3-540-58325-4_224
30 sgo:license sg:explorer/license/
31 sgo:sdDataset chapters
32 rdf:type schema:Chapter
33 N009955278c7740da8a54c76b6b789f3e rdf:first sg:person.013174232477.45
34 rdf:rest rdf:nil
35 N09f9834eac00491eaf13c9af68bec2e7 schema:affiliation grid-institutes:grid.417969.4
36 schema:familyName Pandu Rangan
37 schema:givenName C.
38 rdf:type schema:Person
39 N0f821e3d6b4748b1bd8eafd6366e1dd9 schema:isbn 978-3-540-48653-4
40 978-3-540-58325-7
41 schema:name Algorithms and Computation
42 rdf:type schema:Book
43 N0fb27228c01749f1a8d6bc801817b50c schema:name doi
44 schema:value 10.1007/3-540-58325-4_224
45 rdf:type schema:PropertyValue
46 N166315da838649379532a574f5d8fd72 schema:familyName Zhang
47 schema:givenName Xiang-Sun
48 rdf:type schema:Person
49 N3bfe4efe2ac94444ac69252f984dd0e3 rdf:first N9e4addaceb1f4f319fbd1f9b5d5034b6
50 rdf:rest Ne3317999ccb04d5dafdf78b49770425c
51 N55245007c13245f0b33798deb76c921e schema:name dimensions_id
52 schema:value pub.1013834005
53 rdf:type schema:PropertyValue
54 N5e972db1eec34f6fb12a3f3c65fbe114 schema:name Springer Nature - SN SciGraph project
55 rdf:type schema:Organization
56 N96cefb05a6c94ec2985a84ffe5f5f272 schema:name Springer Nature
57 rdf:type schema:Organisation
58 N9e4addaceb1f4f319fbd1f9b5d5034b6 schema:familyName Du
59 schema:givenName Ding-Zhu
60 rdf:type schema:Person
61 Nbe031f6211ad484583b06e6ffe21d1a7 rdf:first N09f9834eac00491eaf13c9af68bec2e7
62 rdf:rest N009955278c7740da8a54c76b6b789f3e
63 Ne3317999ccb04d5dafdf78b49770425c rdf:first N166315da838649379532a574f5d8fd72
64 rdf:rest rdf:nil
65 sg:person.013174232477.45 schema:affiliation grid-institutes:grid.412047.4
66 schema:familyName Chang
67 schema:givenName Maw-Shang
68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013174232477.45
69 rdf:type schema:Person
70 grid-institutes:grid.412047.4 schema:alternateName Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, Chiayi, 621, Taiwan, China
71 schema:name Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, Chiayi, 621, Taiwan, China
72 rdf:type schema:Organization
73 grid-institutes:grid.417969.4 schema:alternateName Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India
74 schema:name Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India
75 rdf:type schema:Organization
 




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


...