Leaf Powers and Their Properties: Using the Trees View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2008

AUTHORS

Michael R. Fellows , Daniel Meister , Frances A. Rosamond , R. Sritharan , Jan Arne Telle

ABSTRACT

A graph G on n vertices is a k-leaf power () if it is isomorphic to a graph that can be “generated” from a tree T that has n leaves, by taking the leaves to represent vertices of G, and making two vertices adjacent if and only if they are at distance at most k in T. We address two questions in this paper: (1) As k increases, do we always have ? Answering an open question of Andreas Brandstädt and Van Bang Le [2,3,1], we show that the answer, perhaps surprisingly, is “no.” (2) How should one design algorithms to determine, for k-leaf powers, if they have some property? One way this can be done is to use the fact that k-leaf powers have bounded cliquewidth. This fact, plus the FPT cliquewidth approximation algorithm of Oum and Seymour [14], combined with the results of Courcelle, Makowsky and Rotics [7], allows us to conclude that properties expressible in a general logic formalism, can be decided in FPT time for k-leaf powers, parameterizing by k. This is wildly inefficient. We explore a different approach, under the assumption that a generating tree is given with the graph. We show that one can use the tree directly to decide the property, by means of a finite-state tree automaton. (A more general theorem has been independently obtained by Blumensath and Courcelle [5].) We place our results in a general context of “tree-definable” graph classes, of which k-leaf powers are one particular example. More... »

PAGES

402-413

References to SciGraph publications

  • 2007. On (k,ℓ)-Leaf Powers in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2008. On k- Versus (k + 1)-Leaf Powers in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 1999. Parameterized Complexity in NONE
  • 2007. The Clique-Width of Tree-Power and Leaf-Power Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2000-04. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width in THEORY OF COMPUTING SYSTEMS
  • Book

    TITLE

    Algorithms and Computation

    ISBN

    978-3-540-92181-3
    978-3-540-92182-0

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-540-92182-0_37

    DOI

    http://dx.doi.org/10.1007/978-3-540-92182-0_37

    DIMENSIONS

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


    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/0607", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Plant Biology", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/06", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Biological Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Newcastle Australia", 
              "id": "https://www.grid.ac/institutes/grid.266842.c", 
              "name": [
                "University of Newcastle, Newcastle, Australia"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Fellows", 
            "givenName": "Michael R.", 
            "id": "sg:person.011724401755.73", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724401755.73"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Bergen", 
              "id": "https://www.grid.ac/institutes/grid.7914.b", 
              "name": [
                "Department of Informatics, University of Bergen, Norway"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Meister", 
            "givenName": "Daniel", 
            "id": "sg:person.010757077741.72", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010757077741.72"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Newcastle Australia", 
              "id": "https://www.grid.ac/institutes/grid.266842.c", 
              "name": [
                "University of Newcastle, Newcastle, Australia"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rosamond", 
            "givenName": "Frances A.", 
            "id": "sg:person.013624206561.60", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624206561.60"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Dayton", 
              "id": "https://www.grid.ac/institutes/grid.266231.2", 
              "name": [
                "Department of Computer Science, The University of Dayton, Dayton, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Sritharan", 
            "givenName": "R.", 
            "id": "sg:person.013272157557.66", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013272157557.66"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Bergen", 
              "id": "https://www.grid.ac/institutes/grid.7914.b", 
              "name": [
                "Department of Informatics, University of Bergen, Norway"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Telle", 
            "givenName": "Jan Arne", 
            "id": "sg:person.012332206215.14", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012332206215.14"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s002249910009", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004684058", 
              "https://doi.org/10.1007/s002249910009"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85097-7_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009589843", 
              "https://doi.org/10.1007/978-3-540-85097-7_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/jagm.2001.1195", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023071535"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ipl.2006.01.004", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023650431"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ic.2005.11.006", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025683678"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0890-5401(90)90043-h", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027180474"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/jagm.1998.9999", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032096870"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.jctb.2005.10.006", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041612592"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74456-6_47", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046685788", 
              "https://doi.org/10.1007/978-3-540-74456-6_47"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74456-6_47", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046685788", 
              "https://doi.org/10.1007/978-3-540-74456-6_47"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74839-7_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046896354", 
              "https://doi.org/10.1007/978-3-540-74839-7_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74839-7_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046896354", 
              "https://doi.org/10.1007/978-3-540-74839-7_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://app.dimensions.ai/details/publication/pub.1050354225", 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4612-0515-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050354225", 
              "https://doi.org/10.1007/978-1-4612-0515-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4612-0515-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050354225", 
              "https://doi.org/10.1007/978-1-4612-0515-9"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2008", 
        "datePublishedReg": "2008-01-01", 
        "description": "A graph G on n vertices is a k-leaf power () if it is isomorphic to a graph that can be \u201cgenerated\u201d from a tree T that has n leaves, by taking the leaves to represent vertices of G, and making two vertices adjacent if and only if they are at distance at most k in T. We address two questions in this paper: (1) As k increases, do we always have ? Answering an open question of Andreas Brandst\u00e4dt and Van Bang Le [2,3,1], we show that the answer, perhaps surprisingly, is \u201cno.\u201d (2) How should one design algorithms to determine, for k-leaf powers, if they have some property? One way this can be done is to use the fact that k-leaf powers have bounded cliquewidth. This fact, plus the FPT cliquewidth approximation algorithm of Oum and Seymour [14], combined with the results of Courcelle, Makowsky and Rotics [7], allows us to conclude that properties expressible in a general logic formalism, can be decided in FPT time for k-leaf powers, parameterizing by k. This is wildly inefficient. We explore a different approach, under the assumption that a generating tree is given with the graph. We show that one can use the tree directly to decide the property, by means of a finite-state tree automaton. (A more general theorem has been independently obtained by Blumensath and Courcelle [5].) We place our results in a general context of \u201ctree-definable\u201d graph classes, of which k-leaf powers are one particular example.", 
        "editor": [
          {
            "familyName": "Hong", 
            "givenName": "Seok-Hee", 
            "type": "Person"
          }, 
          {
            "familyName": "Nagamochi", 
            "givenName": "Hiroshi", 
            "type": "Person"
          }, 
          {
            "familyName": "Fukunaga", 
            "givenName": "Takuro", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-540-92182-0_37", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-540-92181-3", 
            "978-3-540-92182-0"
          ], 
          "name": "Algorithms and Computation", 
          "type": "Book"
        }, 
        "name": "Leaf Powers and Their Properties: Using the Trees", 
        "pagination": "402-413", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-540-92182-0_37"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "bcafc1cb55fd39eb86441b3a16546441e1610d25658270ebe40bf99e9a73ecec"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1039610614"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-540-92182-0_37", 
          "https://app.dimensions.ai/details/publication/pub.1039610614"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T06:14", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000351_0000000351/records_43244_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-540-92182-0_37"
      }
    ]
     

    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/978-3-540-92182-0_37'

    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/978-3-540-92182-0_37'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-92182-0_37'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-92182-0_37'


     

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

    149 TRIPLES      23 PREDICATES      39 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-540-92182-0_37 schema:about anzsrc-for:06
    2 anzsrc-for:0607
    3 schema:author N9e6d6d7e437b4c7c90c9e3b6a401bf47
    4 schema:citation sg:pub.10.1007/978-1-4612-0515-9
    5 sg:pub.10.1007/978-3-540-74456-6_47
    6 sg:pub.10.1007/978-3-540-74839-7_8
    7 sg:pub.10.1007/978-3-540-85097-7_16
    8 sg:pub.10.1007/s002249910009
    9 https://app.dimensions.ai/details/publication/pub.1050354225
    10 https://doi.org/10.1006/jagm.1998.9999
    11 https://doi.org/10.1006/jagm.2001.1195
    12 https://doi.org/10.1016/0890-5401(90)90043-h
    13 https://doi.org/10.1016/j.ic.2005.11.006
    14 https://doi.org/10.1016/j.ipl.2006.01.004
    15 https://doi.org/10.1016/j.jctb.2005.10.006
    16 schema:datePublished 2008
    17 schema:datePublishedReg 2008-01-01
    18 schema:description A graph G on n vertices is a k-leaf power () if it is isomorphic to a graph that can be “generated” from a tree T that has n leaves, by taking the leaves to represent vertices of G, and making two vertices adjacent if and only if they are at distance at most k in T. We address two questions in this paper: (1) As k increases, do we always have ? Answering an open question of Andreas Brandstädt and Van Bang Le [2,3,1], we show that the answer, perhaps surprisingly, is “no.” (2) How should one design algorithms to determine, for k-leaf powers, if they have some property? One way this can be done is to use the fact that k-leaf powers have bounded cliquewidth. This fact, plus the FPT cliquewidth approximation algorithm of Oum and Seymour [14], combined with the results of Courcelle, Makowsky and Rotics [7], allows us to conclude that properties expressible in a general logic formalism, can be decided in FPT time for k-leaf powers, parameterizing by k. This is wildly inefficient. We explore a different approach, under the assumption that a generating tree is given with the graph. We show that one can use the tree directly to decide the property, by means of a finite-state tree automaton. (A more general theorem has been independently obtained by Blumensath and Courcelle [5].) We place our results in a general context of “tree-definable” graph classes, of which k-leaf powers are one particular example.
    19 schema:editor N230ff34655e54fbcb1f03b43d625eaee
    20 schema:genre chapter
    21 schema:inLanguage en
    22 schema:isAccessibleForFree false
    23 schema:isPartOf Nbd37adb08a64410cbbf89b7deda27824
    24 schema:name Leaf Powers and Their Properties: Using the Trees
    25 schema:pagination 402-413
    26 schema:productId N72bbc836bd224f90b7e244f3503a6645
    27 N9ac804c68e75408e85d7a82c351ba710
    28 Na073c1efb96347c9b0ee6f33d585cf34
    29 schema:publisher N9790b540074f43d2b364ee17077c84ee
    30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039610614
    31 https://doi.org/10.1007/978-3-540-92182-0_37
    32 schema:sdDatePublished 2019-04-16T06:14
    33 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    34 schema:sdPublisher N181a3c26e8bb43ea91fe16237476e88b
    35 schema:url https://link.springer.com/10.1007%2F978-3-540-92182-0_37
    36 sgo:license sg:explorer/license/
    37 sgo:sdDataset chapters
    38 rdf:type schema:Chapter
    39 N006b3d9b4e8d4dab8379da725899ed6b schema:familyName Fukunaga
    40 schema:givenName Takuro
    41 rdf:type schema:Person
    42 N050c2595962d407b8726fad5f5bc19ab schema:familyName Hong
    43 schema:givenName Seok-Hee
    44 rdf:type schema:Person
    45 N07c030379ba64dc0ae15b619a021224c rdf:first sg:person.013272157557.66
    46 rdf:rest N0b6fc001e4b64d7e881867c6958399a8
    47 N0b6fc001e4b64d7e881867c6958399a8 rdf:first sg:person.012332206215.14
    48 rdf:rest rdf:nil
    49 N0d979db6a2ac4fd5853a850e02a1fcd5 rdf:first sg:person.013624206561.60
    50 rdf:rest N07c030379ba64dc0ae15b619a021224c
    51 N181a3c26e8bb43ea91fe16237476e88b schema:name Springer Nature - SN SciGraph project
    52 rdf:type schema:Organization
    53 N230ff34655e54fbcb1f03b43d625eaee rdf:first N050c2595962d407b8726fad5f5bc19ab
    54 rdf:rest N5edf44865ee047e1b77c339b407b6aaf
    55 N5edf44865ee047e1b77c339b407b6aaf rdf:first Nf2b185b4340241f79640a854d6c76fd6
    56 rdf:rest N75576482cd3e419c953de8c4897dccb2
    57 N72bbc836bd224f90b7e244f3503a6645 schema:name dimensions_id
    58 schema:value pub.1039610614
    59 rdf:type schema:PropertyValue
    60 N75576482cd3e419c953de8c4897dccb2 rdf:first N006b3d9b4e8d4dab8379da725899ed6b
    61 rdf:rest rdf:nil
    62 N7c26fbc679be4417a7236fcef9901f60 rdf:first sg:person.010757077741.72
    63 rdf:rest N0d979db6a2ac4fd5853a850e02a1fcd5
    64 N9790b540074f43d2b364ee17077c84ee schema:location Berlin, Heidelberg
    65 schema:name Springer Berlin Heidelberg
    66 rdf:type schema:Organisation
    67 N9ac804c68e75408e85d7a82c351ba710 schema:name doi
    68 schema:value 10.1007/978-3-540-92182-0_37
    69 rdf:type schema:PropertyValue
    70 N9e6d6d7e437b4c7c90c9e3b6a401bf47 rdf:first sg:person.011724401755.73
    71 rdf:rest N7c26fbc679be4417a7236fcef9901f60
    72 Na073c1efb96347c9b0ee6f33d585cf34 schema:name readcube_id
    73 schema:value bcafc1cb55fd39eb86441b3a16546441e1610d25658270ebe40bf99e9a73ecec
    74 rdf:type schema:PropertyValue
    75 Nbd37adb08a64410cbbf89b7deda27824 schema:isbn 978-3-540-92181-3
    76 978-3-540-92182-0
    77 schema:name Algorithms and Computation
    78 rdf:type schema:Book
    79 Nf2b185b4340241f79640a854d6c76fd6 schema:familyName Nagamochi
    80 schema:givenName Hiroshi
    81 rdf:type schema:Person
    82 anzsrc-for:06 schema:inDefinedTermSet anzsrc-for:
    83 schema:name Biological Sciences
    84 rdf:type schema:DefinedTerm
    85 anzsrc-for:0607 schema:inDefinedTermSet anzsrc-for:
    86 schema:name Plant Biology
    87 rdf:type schema:DefinedTerm
    88 sg:person.010757077741.72 schema:affiliation https://www.grid.ac/institutes/grid.7914.b
    89 schema:familyName Meister
    90 schema:givenName Daniel
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010757077741.72
    92 rdf:type schema:Person
    93 sg:person.011724401755.73 schema:affiliation https://www.grid.ac/institutes/grid.266842.c
    94 schema:familyName Fellows
    95 schema:givenName Michael R.
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724401755.73
    97 rdf:type schema:Person
    98 sg:person.012332206215.14 schema:affiliation https://www.grid.ac/institutes/grid.7914.b
    99 schema:familyName Telle
    100 schema:givenName Jan Arne
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012332206215.14
    102 rdf:type schema:Person
    103 sg:person.013272157557.66 schema:affiliation https://www.grid.ac/institutes/grid.266231.2
    104 schema:familyName Sritharan
    105 schema:givenName R.
    106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013272157557.66
    107 rdf:type schema:Person
    108 sg:person.013624206561.60 schema:affiliation https://www.grid.ac/institutes/grid.266842.c
    109 schema:familyName Rosamond
    110 schema:givenName Frances A.
    111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624206561.60
    112 rdf:type schema:Person
    113 sg:pub.10.1007/978-1-4612-0515-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050354225
    114 https://doi.org/10.1007/978-1-4612-0515-9
    115 rdf:type schema:CreativeWork
    116 sg:pub.10.1007/978-3-540-74456-6_47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046685788
    117 https://doi.org/10.1007/978-3-540-74456-6_47
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/978-3-540-74839-7_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046896354
    120 https://doi.org/10.1007/978-3-540-74839-7_8
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/978-3-540-85097-7_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009589843
    123 https://doi.org/10.1007/978-3-540-85097-7_16
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1007/s002249910009 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004684058
    126 https://doi.org/10.1007/s002249910009
    127 rdf:type schema:CreativeWork
    128 https://app.dimensions.ai/details/publication/pub.1050354225 schema:CreativeWork
    129 https://doi.org/10.1006/jagm.1998.9999 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032096870
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1006/jagm.2001.1195 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023071535
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1016/0890-5401(90)90043-h schema:sameAs https://app.dimensions.ai/details/publication/pub.1027180474
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1016/j.ic.2005.11.006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025683678
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1016/j.ipl.2006.01.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023650431
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1016/j.jctb.2005.10.006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041612592
    140 rdf:type schema:CreativeWork
    141 https://www.grid.ac/institutes/grid.266231.2 schema:alternateName University of Dayton
    142 schema:name Department of Computer Science, The University of Dayton, Dayton, USA
    143 rdf:type schema:Organization
    144 https://www.grid.ac/institutes/grid.266842.c schema:alternateName University of Newcastle Australia
    145 schema:name University of Newcastle, Newcastle, Australia
    146 rdf:type schema:Organization
    147 https://www.grid.ac/institutes/grid.7914.b schema:alternateName University of Bergen
    148 schema:name Department of Informatics, University of Bergen, Norway
    149 rdf:type schema:Organization
     




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


    ...