Parallel algorithm for cograph recognition with applications View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1992

AUTHORS

Xin He

ABSTRACT

We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log2n) time with O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using O(log n) time with O(n) processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes O(log2n) time with O(n) processors. More... »

PAGES

94-105

Book

TITLE

Algorithm Theory — SWAT '92

ISBN

978-3-540-55706-7
978-3-540-47275-9

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-55706-7_9

DOI

http://dx.doi.org/10.1007/3-540-55706-7_9

DIMENSIONS

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


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, State University of New York at Buffalo, 14260, Buffalo, NY", 
          "id": "http://www.grid.ac/institutes/grid.273335.3", 
          "name": [
            "Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY"
          ], 
          "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": "1992", 
    "datePublishedReg": "1992-01-01", 
    "description": "We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log2n) time with O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using O(log n) time with O(n) processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes O(log2n) time with O(n) processors.", 
    "editor": [
      {
        "familyName": "Nurmi", 
        "givenName": "Otto", 
        "type": "Person"
      }, 
      {
        "familyName": "Ukkonen", 
        "givenName": "Esko", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-55706-7_9", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-55706-7", 
        "978-3-540-47275-9"
      ], 
      "name": "Algorithm Theory \u2014 SWAT '92", 
      "type": "Book"
    }, 
    "keywords": [
      "parallel algorithm", 
      "cograph recognition", 
      "CRCW PRAM", 
      "cotree representation", 
      "algorithm", 
      "number of vertices", 
      "representation problem", 
      "processors", 
      "tree problem", 
      "permutation graphs", 
      "graph", 
      "cographs", 
      "PRAM", 
      "cotree", 
      "representation", 
      "recognition", 
      "applications", 
      "vertices", 
      "time", 
      "edge", 
      "number", 
      "problem", 
      "permutation representation problem", 
      "depthfirst"
    ], 
    "name": "Parallel algorithm for cograph recognition with applications", 
    "pagination": "94-105", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1043688111"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-55706-7_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-55706-7_9", 
      "https://app.dimensions.ai/details/publication/pub.1043688111"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:15", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_276.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-55706-7_9"
  }
]
 

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-55706-7_9'

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-55706-7_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-55706-7_9'

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-55706-7_9'


 

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

89 TRIPLES      23 PREDICATES      50 URIs      43 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-55706-7_9 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N4ea3da1d2ecb4250b04b9331871be029
4 schema:datePublished 1992
5 schema:datePublishedReg 1992-01-01
6 schema:description We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log2n) time with O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using O(log n) time with O(n) processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes O(log2n) time with O(n) processors.
7 schema:editor N98ca3749f7e24a49b0773da3d6bac425
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Na15f286a2c7e4cb8bf598934a946d931
12 schema:keywords CRCW PRAM
13 PRAM
14 algorithm
15 applications
16 cograph recognition
17 cographs
18 cotree
19 cotree representation
20 depthfirst
21 edge
22 graph
23 number
24 number of vertices
25 parallel algorithm
26 permutation graphs
27 permutation representation problem
28 problem
29 processors
30 recognition
31 representation
32 representation problem
33 time
34 tree problem
35 vertices
36 schema:name Parallel algorithm for cograph recognition with applications
37 schema:pagination 94-105
38 schema:productId N5090e59d2c0741b4a1396f0ea96e6dfd
39 N98be5111a3d3416bb12099df054e1ca9
40 schema:publisher N0fad1198d9ea4447bd787a819e44aa4a
41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043688111
42 https://doi.org/10.1007/3-540-55706-7_9
43 schema:sdDatePublished 2022-01-01T19:15
44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
45 schema:sdPublisher N5660aae392ed418496dac5f4fa7d83e9
46 schema:url https://doi.org/10.1007/3-540-55706-7_9
47 sgo:license sg:explorer/license/
48 sgo:sdDataset chapters
49 rdf:type schema:Chapter
50 N0fad1198d9ea4447bd787a819e44aa4a schema:name Springer Nature
51 rdf:type schema:Organisation
52 N437744f4514a4f218e2ab3ade7854d75 schema:familyName Ukkonen
53 schema:givenName Esko
54 rdf:type schema:Person
55 N43e87fec960b476fafa1ef399e022d00 schema:familyName Nurmi
56 schema:givenName Otto
57 rdf:type schema:Person
58 N4ea3da1d2ecb4250b04b9331871be029 rdf:first sg:person.011352641523.42
59 rdf:rest rdf:nil
60 N5090e59d2c0741b4a1396f0ea96e6dfd schema:name dimensions_id
61 schema:value pub.1043688111
62 rdf:type schema:PropertyValue
63 N5660aae392ed418496dac5f4fa7d83e9 schema:name Springer Nature - SN SciGraph project
64 rdf:type schema:Organization
65 N98be5111a3d3416bb12099df054e1ca9 schema:name doi
66 schema:value 10.1007/3-540-55706-7_9
67 rdf:type schema:PropertyValue
68 N98ca3749f7e24a49b0773da3d6bac425 rdf:first N43e87fec960b476fafa1ef399e022d00
69 rdf:rest Nda3291c1a7fc4991aa18a744037fff8b
70 Na15f286a2c7e4cb8bf598934a946d931 schema:isbn 978-3-540-47275-9
71 978-3-540-55706-7
72 schema:name Algorithm Theory — SWAT '92
73 rdf:type schema:Book
74 Nda3291c1a7fc4991aa18a744037fff8b rdf:first N437744f4514a4f218e2ab3ade7854d75
75 rdf:rest rdf:nil
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 grid-institutes:grid.273335.3 schema:alternateName Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY
88 schema:name Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY
89 rdf:type schema:Organization
 




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


...