Sweeping Graphs with Large Clique Number View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2004

AUTHORS

Boting Yang , Danny Dyer , Brian Alspach

ABSTRACT

An open problem in sweeping is the existence of a graph with connected sweep number strictly less than monotonic connected sweep number. We solve this problem by constructing a graph W exhibiting exactly this property. Further, we will examine a new method of constructing graphs that makes proving all such inequalities easier, and offer some new lower bounds on sweep numbers. More... »

PAGES

908-920

References to SciGraph publications

  • 2003. Searching Is Not Jumping in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • Book

    TITLE

    Algorithms and Computation

    ISBN

    978-3-540-24131-7
    978-3-540-30551-4

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-540-30551-4_77

    DOI

    http://dx.doi.org/10.1007/978-3-540-30551-4_77

    DIMENSIONS

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


    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/0101", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Pure Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Mathematical Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Regina", 
              "id": "https://www.grid.ac/institutes/grid.57926.3f", 
              "name": [
                "Department of Computer Science, University of Regina"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Yang", 
            "givenName": "Boting", 
            "id": "sg:person.010020724604.82", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010020724604.82"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Simon Fraser University", 
              "id": "https://www.grid.ac/institutes/grid.61971.38", 
              "name": [
                "Department of Mathematics, Simon Fraser University"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Dyer", 
            "givenName": "Danny", 
            "id": "sg:person.015173770711.52", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015173770711.52"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Regina", 
              "id": "https://www.grid.ac/institutes/grid.57926.3f", 
              "name": [
                "Department of Mathematics and Statistics, University of Regina"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Alspach", 
            "givenName": "Brian", 
            "id": "sg:person.012155470203.67", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012155470203.67"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/151261.151263", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017456454"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39890-5_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025064061", 
              "https://doi.org/10.1007/978-3-540-39890-5_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39890-5_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025064061", 
              "https://doi.org/10.1007/978-3-540-39890-5_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0196-6774(91)90003-h", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033945460"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/42267.42268", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045068727"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2004", 
        "datePublishedReg": "2004-01-01", 
        "description": "An open problem in sweeping is the existence of a graph with connected sweep number strictly less than monotonic connected sweep number. We solve this problem by constructing a graph W exhibiting exactly this property. Further, we will examine a new method of constructing graphs that makes proving all such inequalities easier, and offer some new lower bounds on sweep numbers.", 
        "editor": [
          {
            "familyName": "Fleischer", 
            "givenName": "Rudolf", 
            "type": "Person"
          }, 
          {
            "familyName": "Trippen", 
            "givenName": "Gerhard", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-540-30551-4_77", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-540-24131-7", 
            "978-3-540-30551-4"
          ], 
          "name": "Algorithms and Computation", 
          "type": "Book"
        }, 
        "name": "Sweeping Graphs with Large Clique Number", 
        "pagination": "908-920", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1020618149"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-540-30551-4_77"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "623e012f91dda9437e19bd1954d1c908b72a834444af9e1be0b9d86a2fa47a4e"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-540-30551-4_77", 
          "https://app.dimensions.ai/details/publication/pub.1020618149"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T08:38", 
        "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/0000000365_0000000365/records_71707_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-540-30551-4_77"
      }
    ]
     

    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-30551-4_77'

    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-30551-4_77'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30551-4_77'

    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-30551-4_77'


     

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

    101 TRIPLES      23 PREDICATES      31 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-540-30551-4_77 schema:about anzsrc-for:01
    2 anzsrc-for:0101
    3 schema:author N043d065deb924e81a0a2caa2e534ccd7
    4 schema:citation sg:pub.10.1007/978-3-540-39890-5_4
    5 https://doi.org/10.1016/0196-6774(91)90003-h
    6 https://doi.org/10.1145/151261.151263
    7 https://doi.org/10.1145/42267.42268
    8 schema:datePublished 2004
    9 schema:datePublishedReg 2004-01-01
    10 schema:description An open problem in sweeping is the existence of a graph with connected sweep number strictly less than monotonic connected sweep number. We solve this problem by constructing a graph W exhibiting exactly this property. Further, we will examine a new method of constructing graphs that makes proving all such inequalities easier, and offer some new lower bounds on sweep numbers.
    11 schema:editor Nbf6e8d260d324ec090d9cc8b455b21e6
    12 schema:genre chapter
    13 schema:inLanguage en
    14 schema:isAccessibleForFree false
    15 schema:isPartOf Nbd38b24c027443cb9497946ba1d14de4
    16 schema:name Sweeping Graphs with Large Clique Number
    17 schema:pagination 908-920
    18 schema:productId N898d5436e1cb488190b57f49ef63ea64
    19 Na3ee86d0888d492f9a311ad66da9ea37
    20 Nffdb15e0490c4176bb00ec51e247b2d7
    21 schema:publisher N9c62ba323536442886125e5777e3d49f
    22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020618149
    23 https://doi.org/10.1007/978-3-540-30551-4_77
    24 schema:sdDatePublished 2019-04-16T08:38
    25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    26 schema:sdPublisher Ne4604e9e0ad746d0bac950caf2a5a2d3
    27 schema:url https://link.springer.com/10.1007%2F978-3-540-30551-4_77
    28 sgo:license sg:explorer/license/
    29 sgo:sdDataset chapters
    30 rdf:type schema:Chapter
    31 N043d065deb924e81a0a2caa2e534ccd7 rdf:first sg:person.010020724604.82
    32 rdf:rest N75b9bf879e5a45d38f888b6237bcd206
    33 N25160d2f011a4910bb24aecee3cb0fcc schema:familyName Fleischer
    34 schema:givenName Rudolf
    35 rdf:type schema:Person
    36 N28747c2afde6419d88e16bbf153d1dca rdf:first N6b19379106294129885273e8525d3f24
    37 rdf:rest rdf:nil
    38 N6b19379106294129885273e8525d3f24 schema:familyName Trippen
    39 schema:givenName Gerhard
    40 rdf:type schema:Person
    41 N75b9bf879e5a45d38f888b6237bcd206 rdf:first sg:person.015173770711.52
    42 rdf:rest Nb60a25de72fd433d823eab889310e659
    43 N898d5436e1cb488190b57f49ef63ea64 schema:name dimensions_id
    44 schema:value pub.1020618149
    45 rdf:type schema:PropertyValue
    46 N9c62ba323536442886125e5777e3d49f schema:location Berlin, Heidelberg
    47 schema:name Springer Berlin Heidelberg
    48 rdf:type schema:Organisation
    49 Na3ee86d0888d492f9a311ad66da9ea37 schema:name doi
    50 schema:value 10.1007/978-3-540-30551-4_77
    51 rdf:type schema:PropertyValue
    52 Nb60a25de72fd433d823eab889310e659 rdf:first sg:person.012155470203.67
    53 rdf:rest rdf:nil
    54 Nbd38b24c027443cb9497946ba1d14de4 schema:isbn 978-3-540-24131-7
    55 978-3-540-30551-4
    56 schema:name Algorithms and Computation
    57 rdf:type schema:Book
    58 Nbf6e8d260d324ec090d9cc8b455b21e6 rdf:first N25160d2f011a4910bb24aecee3cb0fcc
    59 rdf:rest N28747c2afde6419d88e16bbf153d1dca
    60 Ne4604e9e0ad746d0bac950caf2a5a2d3 schema:name Springer Nature - SN SciGraph project
    61 rdf:type schema:Organization
    62 Nffdb15e0490c4176bb00ec51e247b2d7 schema:name readcube_id
    63 schema:value 623e012f91dda9437e19bd1954d1c908b72a834444af9e1be0b9d86a2fa47a4e
    64 rdf:type schema:PropertyValue
    65 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    66 schema:name Mathematical Sciences
    67 rdf:type schema:DefinedTerm
    68 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
    69 schema:name Pure Mathematics
    70 rdf:type schema:DefinedTerm
    71 sg:person.010020724604.82 schema:affiliation https://www.grid.ac/institutes/grid.57926.3f
    72 schema:familyName Yang
    73 schema:givenName Boting
    74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010020724604.82
    75 rdf:type schema:Person
    76 sg:person.012155470203.67 schema:affiliation https://www.grid.ac/institutes/grid.57926.3f
    77 schema:familyName Alspach
    78 schema:givenName Brian
    79 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012155470203.67
    80 rdf:type schema:Person
    81 sg:person.015173770711.52 schema:affiliation https://www.grid.ac/institutes/grid.61971.38
    82 schema:familyName Dyer
    83 schema:givenName Danny
    84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015173770711.52
    85 rdf:type schema:Person
    86 sg:pub.10.1007/978-3-540-39890-5_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025064061
    87 https://doi.org/10.1007/978-3-540-39890-5_4
    88 rdf:type schema:CreativeWork
    89 https://doi.org/10.1016/0196-6774(91)90003-h schema:sameAs https://app.dimensions.ai/details/publication/pub.1033945460
    90 rdf:type schema:CreativeWork
    91 https://doi.org/10.1145/151261.151263 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017456454
    92 rdf:type schema:CreativeWork
    93 https://doi.org/10.1145/42267.42268 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045068727
    94 rdf:type schema:CreativeWork
    95 https://www.grid.ac/institutes/grid.57926.3f schema:alternateName University of Regina
    96 schema:name Department of Computer Science, University of Regina
    97 Department of Mathematics and Statistics, University of Regina
    98 rdf:type schema:Organization
    99 https://www.grid.ac/institutes/grid.61971.38 schema:alternateName Simon Fraser University
    100 schema:name Department of Mathematics, Simon Fraser University
    101 rdf:type schema:Organization
     




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


    ...