Bounds and Algorithms for Geodetic Hulls

No Thumbnail Available
Files
There are no files associated with this item.
Date
2022
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Published
Published in
Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / Balachandran, Niranjan; Inkulu, R. (ed.). - Cham : Springer, 2022. - (Lecture Notes in Computer Science ; 13179). - pp. 181-194. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-030-95017-0
Abstract
The paper is devoted to the study of geodetic convex hulls in graphs from a theoretical and practical perspective. The notion of convexity can be transferred from continuous geometry to discrete graph structures by defining a node subset to be (geodetically) convex if all shortest paths between its members do not leave the subset. The geodetic convex hull of a node set W is the smallest convex superset of W. The hull number of a graph is then defined as the size of the smallest node subset S (called hull set) whose convex hull contains all graph nodes. In contrast to the geometric setting, where the point subset on the boundary of the convex hull can be computed in polynomial time, it is NP-hard to decide whether a graph has a hull set of size at most s∈N. We establish novel theoretical bounds for graph parameters related to convex graph structures, and also design practical algorithms for upper and lower bounding the hull number. We evaluate the quality of our bounds as well as the performance of the proposed algorithms on road networks and wireless sensor networks of varying size.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Hull number, Graph contour, Geodetic iteration number
Conference
Algorithms and Discrete Applied Mathematics, Feb 10, 2022 - Feb 12, 2022, Puducherry
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690STORANDT, Sabine, 2022. Bounds and Algorithms for Geodetic Hulls. Algorithms and Discrete Applied Mathematics. Puducherry, Feb 10, 2022 - Feb 12, 2022. In: BALACHANDRAN, Niranjan, ed., R. INKULU, ed.. Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings. Cham:Springer, pp. 181-194. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-95017-0. Available under: doi: 10.1007/978-3-030-95018-7_15
BibTex
@inproceedings{Storandt2022Bound-57069,
  year={2022},
  doi={10.1007/978-3-030-95018-7_15},
  title={Bounds and Algorithms for Geodetic Hulls},
  number={13179},
  isbn={978-3-030-95017-0},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings},
  pages={181--194},
  editor={Balachandran, Niranjan and Inkulu, R.},
  author={Storandt, Sabine}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/57069">
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dc:language>eng</dc:language>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/57069"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Bounds and Algorithms for Geodetic Hulls</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2022</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-30T08:32:49Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">The paper is devoted to the study of geodetic convex hulls in graphs from a theoretical and practical perspective. The notion of convexity can be transferred from continuous geometry to discrete graph structures by defining a node subset to be (geodetically) convex if all shortest paths between its members do not leave the subset. The geodetic convex hull of a node set W is the smallest convex superset of W. The hull number of a graph is then defined as the size of the smallest node subset S (called hull set) whose convex hull contains all graph nodes. In contrast to the geometric setting, where the point subset on the boundary of the convex hull can be computed in polynomial time, it is NP-hard to decide whether a graph has a hull set of size at most s∈N. We establish novel theoretical bounds for graph parameters related to convex graph structures, and also design practical algorithms for upper and lower bounding the hull number. We evaluate the quality of our bounds as well as the performance of the proposed algorithms on road networks and wireless sensor networks of varying size.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-30T08:32:49Z</dc:date>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Storandt, Sabine</dc:creator>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Yes