A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2005

AUTHORS

W. Henry Suters , Faisal N. Abu-Khzam , Yun Zhang , Christopher T. Symons , Nagiza F. Samatova , Michael A. Langston

ABSTRACT

The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of product graph built from the inputs. In this paper a new algorithm, termed “clique branching,” is proposed that exploits a special structure inherent in the association graph. This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. More... »

PAGES

717-727

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11533719_73

DOI

http://dx.doi.org/10.1007/11533719_73

DIMENSIONS

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


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/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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Carson Newman College", 
          "id": "https://www.grid.ac/institutes/grid.432998.d", 
          "name": [
            "Department of Mathematics and Computer Science, Carson-Newman College, CN Box 71958, 37760, Jefferson City, TN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Suters", 
        "givenName": "W. Henry", 
        "id": "sg:person.07512420001.13", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07512420001.13"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Lebanese American University", 
          "id": "https://www.grid.ac/institutes/grid.411323.6", 
          "name": [
            "Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Abu-Khzam", 
        "givenName": "Faisal N.", 
        "id": "sg:person.010673015605.56", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010673015605.56"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Tennessee at Knoxville", 
          "id": "https://www.grid.ac/institutes/grid.411461.7", 
          "name": [
            "Department of Computer Science, University of Tennessee, 37996 3450, Knoxville, TN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zhang", 
        "givenName": "Yun", 
        "id": "sg:person.01012445310.23", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01012445310.23"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Oak Ridge National Laboratory", 
          "id": "https://www.grid.ac/institutes/grid.135519.a", 
          "name": [
            "Computer Science and Mathematics Division, Oak Ridge National Laboratory, P.O. Box 2008, 37831 6367, Oak Ridge, TN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Symons", 
        "givenName": "Christopher T.", 
        "id": "sg:person.07460765211.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07460765211.69"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Oak Ridge National Laboratory", 
          "id": "https://www.grid.ac/institutes/grid.135519.a", 
          "name": [
            "Computer Science and Mathematics Division, Oak Ridge National Laboratory, P.O. Box 2008, 37831 6367, Oak Ridge, TN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Samatova", 
        "givenName": "Nagiza F.", 
        "id": "sg:person.01360475442.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01360475442.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Tennessee at Knoxville", 
          "id": "https://www.grid.ac/institutes/grid.411461.7", 
          "name": [
            "Department of Computer Science, University of Tennessee, 37996 3450, Knoxville, TN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Langston", 
        "givenName": "Michael A.", 
        "id": "sg:person.01102314053.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01102314053.86"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0167-8655(02)00256-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002178641"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0167-8655(02)00256-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002178641"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0304-3975(00)00286-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002396737"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1021271615909", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013172110", 
          "https://doi.org/10.1023/a:1021271615909"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45028-9_12", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015430865", 
          "https://doi.org/10.1007/3-540-45028-9_12"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45028-9_12", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015430865", 
          "https://doi.org/10.1007/3-540-45028-9_12"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ipl.2004.06.019", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015444365"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4757-3023-4_1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1027732500", 
          "https://doi.org/10.1007/978-1-4757-3023-4_1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/spe.588", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1027808390"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-70659-3_12", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029153321", 
          "https://doi.org/10.1007/3-540-70659-3_12"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0031-3203(00)00048-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1032001799"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/spe.4380120103", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039746604"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-55210-3_198", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040657953", 
          "https://doi.org/10.1007/3-540-55210-3_198"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02575586", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041808659", 
          "https://doi.org/10.1007/bf02575586"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02575586", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041808659", 
          "https://doi.org/10.1007/bf02575586"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/362342.362367", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049082651"
        ], 
        "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"
      }, 
      {
        "id": "https://doi.org/10.1021/ci00031a005", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1055400530"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/s0218001404003228", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062949422"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/aiccsa.2005.1387015", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093379169"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of product graph built from the inputs. In this paper a new algorithm, termed \u201cclique branching,\u201d is proposed that exploits a special structure inherent in the association graph. This structure contains a large number of naturally-ordered cliques that are present in the association graph\u2019s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem.", 
    "editor": [
      {
        "familyName": "Wang", 
        "givenName": "Lusheng", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11533719_73", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-28061-3", 
        "978-3-540-31806-4"
      ], 
      "name": "Computing and Combinatorics", 
      "type": "Book"
    }, 
    "name": "A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem", 
    "pagination": "717-727", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1017311354"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11533719_73"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "527a7c328d47b1136ba6decf4aff31417c8b8496584176951f74c368b1bea038"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11533719_73", 
      "https://app.dimensions.ai/details/publication/pub.1017311354"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T08:24", 
    "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/0000000363_0000000363/records_70046_00000000.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F11533719_73"
  }
]
 

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/11533719_73'

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/11533719_73'

Turtle is a human-readable linked data format.

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

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

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


 

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

169 TRIPLES      23 PREDICATES      45 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11533719_73 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N3f7539b28a414a50a3f9d22b28bf676e
4 schema:citation sg:pub.10.1007/3-540-45028-9_12
5 sg:pub.10.1007/3-540-55210-3_198
6 sg:pub.10.1007/3-540-70659-3_12
7 sg:pub.10.1007/978-1-4612-0515-9
8 sg:pub.10.1007/978-1-4757-3023-4_1
9 sg:pub.10.1007/bf02575586
10 sg:pub.10.1023/a:1021271615909
11 https://app.dimensions.ai/details/publication/pub.1050354225
12 https://doi.org/10.1002/spe.4380120103
13 https://doi.org/10.1002/spe.588
14 https://doi.org/10.1016/j.ipl.2004.06.019
15 https://doi.org/10.1016/s0031-3203(00)00048-0
16 https://doi.org/10.1016/s0167-8655(02)00256-8
17 https://doi.org/10.1016/s0304-3975(00)00286-3
18 https://doi.org/10.1021/ci00031a005
19 https://doi.org/10.1109/aiccsa.2005.1387015
20 https://doi.org/10.1142/s0218001404003228
21 https://doi.org/10.1145/362342.362367
22 schema:datePublished 2005
23 schema:datePublishedReg 2005-01-01
24 schema:description The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of product graph built from the inputs. In this paper a new algorithm, termed “clique branching,” is proposed that exploits a special structure inherent in the association graph. This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem.
25 schema:editor Na57c36bc5f694aa488662eb3d8930998
26 schema:genre chapter
27 schema:inLanguage en
28 schema:isAccessibleForFree true
29 schema:isPartOf Ncdfc00865f444b79be6774b148496a3a
30 schema:name A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
31 schema:pagination 717-727
32 schema:productId N2154a1a33aff415b94de8e0fa61a6c2a
33 N7e56145c3f16423782a2d67351bf3b89
34 Nc5a01c39ae514a37907105f2e3fa3fbc
35 schema:publisher N486ee914814543dcadfffaa2fcc069c6
36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017311354
37 https://doi.org/10.1007/11533719_73
38 schema:sdDatePublished 2019-04-16T08:24
39 schema:sdLicense https://scigraph.springernature.com/explorer/license/
40 schema:sdPublisher N7b2fcc4df1ef4ad3856be229a44c2dfe
41 schema:url https://link.springer.com/10.1007%2F11533719_73
42 sgo:license sg:explorer/license/
43 sgo:sdDataset chapters
44 rdf:type schema:Chapter
45 N0d54429d08194c4fa92b28267ab0abf8 rdf:first sg:person.01012445310.23
46 rdf:rest Nc2946965d2384be584f1af22f5618a84
47 N2154a1a33aff415b94de8e0fa61a6c2a schema:name doi
48 schema:value 10.1007/11533719_73
49 rdf:type schema:PropertyValue
50 N3f7539b28a414a50a3f9d22b28bf676e rdf:first sg:person.07512420001.13
51 rdf:rest Neca1977a4b1644ee9e89c1e8400e5791
52 N486ee914814543dcadfffaa2fcc069c6 schema:location Berlin, Heidelberg
53 schema:name Springer Berlin Heidelberg
54 rdf:type schema:Organisation
55 N7b2fcc4df1ef4ad3856be229a44c2dfe schema:name Springer Nature - SN SciGraph project
56 rdf:type schema:Organization
57 N7e56145c3f16423782a2d67351bf3b89 schema:name dimensions_id
58 schema:value pub.1017311354
59 rdf:type schema:PropertyValue
60 N9068ca8840fe452dbeef5cc2764afbac rdf:first sg:person.01102314053.86
61 rdf:rest rdf:nil
62 Na57c36bc5f694aa488662eb3d8930998 rdf:first Nd4870e7ce5f54995b8081d288cc57d2a
63 rdf:rest rdf:nil
64 Nb1c674711b8d4f3d8b3f862fb61039a8 rdf:first sg:person.01360475442.35
65 rdf:rest N9068ca8840fe452dbeef5cc2764afbac
66 Nc2946965d2384be584f1af22f5618a84 rdf:first sg:person.07460765211.69
67 rdf:rest Nb1c674711b8d4f3d8b3f862fb61039a8
68 Nc5a01c39ae514a37907105f2e3fa3fbc schema:name readcube_id
69 schema:value 527a7c328d47b1136ba6decf4aff31417c8b8496584176951f74c368b1bea038
70 rdf:type schema:PropertyValue
71 Ncdfc00865f444b79be6774b148496a3a schema:isbn 978-3-540-28061-3
72 978-3-540-31806-4
73 schema:name Computing and Combinatorics
74 rdf:type schema:Book
75 Nd4870e7ce5f54995b8081d288cc57d2a schema:familyName Wang
76 schema:givenName Lusheng
77 rdf:type schema:Person
78 Neca1977a4b1644ee9e89c1e8400e5791 rdf:first sg:person.010673015605.56
79 rdf:rest N0d54429d08194c4fa92b28267ab0abf8
80 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
81 schema:name Information and Computing Sciences
82 rdf:type schema:DefinedTerm
83 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
84 schema:name Computation Theory and Mathematics
85 rdf:type schema:DefinedTerm
86 sg:person.01012445310.23 schema:affiliation https://www.grid.ac/institutes/grid.411461.7
87 schema:familyName Zhang
88 schema:givenName Yun
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01012445310.23
90 rdf:type schema:Person
91 sg:person.010673015605.56 schema:affiliation https://www.grid.ac/institutes/grid.411323.6
92 schema:familyName Abu-Khzam
93 schema:givenName Faisal N.
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010673015605.56
95 rdf:type schema:Person
96 sg:person.01102314053.86 schema:affiliation https://www.grid.ac/institutes/grid.411461.7
97 schema:familyName Langston
98 schema:givenName Michael A.
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01102314053.86
100 rdf:type schema:Person
101 sg:person.01360475442.35 schema:affiliation https://www.grid.ac/institutes/grid.135519.a
102 schema:familyName Samatova
103 schema:givenName Nagiza F.
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01360475442.35
105 rdf:type schema:Person
106 sg:person.07460765211.69 schema:affiliation https://www.grid.ac/institutes/grid.135519.a
107 schema:familyName Symons
108 schema:givenName Christopher T.
109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07460765211.69
110 rdf:type schema:Person
111 sg:person.07512420001.13 schema:affiliation https://www.grid.ac/institutes/grid.432998.d
112 schema:familyName Suters
113 schema:givenName W. Henry
114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07512420001.13
115 rdf:type schema:Person
116 sg:pub.10.1007/3-540-45028-9_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015430865
117 https://doi.org/10.1007/3-540-45028-9_12
118 rdf:type schema:CreativeWork
119 sg:pub.10.1007/3-540-55210-3_198 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040657953
120 https://doi.org/10.1007/3-540-55210-3_198
121 rdf:type schema:CreativeWork
122 sg:pub.10.1007/3-540-70659-3_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029153321
123 https://doi.org/10.1007/3-540-70659-3_12
124 rdf:type schema:CreativeWork
125 sg:pub.10.1007/978-1-4612-0515-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050354225
126 https://doi.org/10.1007/978-1-4612-0515-9
127 rdf:type schema:CreativeWork
128 sg:pub.10.1007/978-1-4757-3023-4_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027732500
129 https://doi.org/10.1007/978-1-4757-3023-4_1
130 rdf:type schema:CreativeWork
131 sg:pub.10.1007/bf02575586 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041808659
132 https://doi.org/10.1007/bf02575586
133 rdf:type schema:CreativeWork
134 sg:pub.10.1023/a:1021271615909 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013172110
135 https://doi.org/10.1023/a:1021271615909
136 rdf:type schema:CreativeWork
137 https://app.dimensions.ai/details/publication/pub.1050354225 schema:CreativeWork
138 https://doi.org/10.1002/spe.4380120103 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039746604
139 rdf:type schema:CreativeWork
140 https://doi.org/10.1002/spe.588 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027808390
141 rdf:type schema:CreativeWork
142 https://doi.org/10.1016/j.ipl.2004.06.019 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015444365
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1016/s0031-3203(00)00048-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032001799
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1016/s0167-8655(02)00256-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002178641
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1016/s0304-3975(00)00286-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002396737
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1021/ci00031a005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1055400530
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1109/aiccsa.2005.1387015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093379169
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1142/s0218001404003228 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062949422
155 rdf:type schema:CreativeWork
156 https://doi.org/10.1145/362342.362367 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049082651
157 rdf:type schema:CreativeWork
158 https://www.grid.ac/institutes/grid.135519.a schema:alternateName Oak Ridge National Laboratory
159 schema:name Computer Science and Mathematics Division, Oak Ridge National Laboratory, P.O. Box 2008, 37831 6367, Oak Ridge, TN, USA
160 rdf:type schema:Organization
161 https://www.grid.ac/institutes/grid.411323.6 schema:alternateName Lebanese American University
162 schema:name Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon
163 rdf:type schema:Organization
164 https://www.grid.ac/institutes/grid.411461.7 schema:alternateName University of Tennessee at Knoxville
165 schema:name Department of Computer Science, University of Tennessee, 37996 3450, Knoxville, TN, USA
166 rdf:type schema:Organization
167 https://www.grid.ac/institutes/grid.432998.d schema:alternateName Carson Newman College
168 schema:name Department of Mathematics and Computer Science, Carson-Newman College, CN Box 71958, 37760, Jefferson City, TN, USA
169 rdf:type schema:Organization
 




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


...