Publikation:

Positional Dominance : Concepts and Algorithms

Lade...
Vorschaubild

Dateien

Brandes_0-419565.pdf
Brandes_0-419565.pdfGröße: 162.21 KBDownloads: 830

Datum

2017

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

GAUR, Daya, ed., N.S. NARAYANASWAMY, ed.. Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017 ; Proceedings. Cham: Springer, 2017, pp. 60-71. Lecture Notes in Computer Science. 10156. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-53006-2. Available under: doi: 10.1007/978-3-319-53007-9_6

Zusammenfassung

Centrality indices assign values to the vertices of a graph such that vertices with higher values are considered more central. Triggered by a recent result on the preservation of the vicinal preorder in rankings obtained from common centrality indices, we review and extend notions of domination among vertices. These may serve as building blocks for new concepts of centrality that extend more directly, and more coherently, to more general types of data such as multilayer networks. We also give efficient algorithms to construct the associated partial rankings.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

CALDAM 2017 : Algorithms and Discrete Applied Mathematics, Third International Conference, 16. Feb. 2017 - 18. Feb. 2017, Sancoale, Goa, India
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BRANDES, Ulrik, Moritz HEINE, Julian MÜLLER, Mark ORTMANN, 2017. Positional Dominance : Concepts and Algorithms. CALDAM 2017 : Algorithms and Discrete Applied Mathematics, Third International Conference. Sancoale, Goa, India, 16. Feb. 2017 - 18. Feb. 2017. In: GAUR, Daya, ed., N.S. NARAYANASWAMY, ed.. Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017 ; Proceedings. Cham: Springer, 2017, pp. 60-71. Lecture Notes in Computer Science. 10156. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-53006-2. Available under: doi: 10.1007/978-3-319-53007-9_6
BibTex
@inproceedings{Brandes2017-01-26Posit-39741,
  year={2017},
  doi={10.1007/978-3-319-53007-9_6},
  title={Positional Dominance : Concepts and Algorithms},
  number={10156},
  isbn={978-3-319-53006-2},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017 ; Proceedings},
  pages={60--71},
  editor={Gaur, Daya and Narayanaswamy, N.S.},
  author={Brandes, Ulrik and Heine, Moritz and Müller, Julian and Ortmann, Mark}
}
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/39741">
    <dcterms:title>Positional Dominance : Concepts and Algorithms</dcterms:title>
    <dc:creator>Müller, Julian</dc:creator>
    <dcterms:issued>2017-01-26</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-02T13:14:04Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Ortmann, Mark</dc:contributor>
    <dc:creator>Heine, Moritz</dc:creator>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:contributor>Heine, Moritz</dc:contributor>
    <dc:creator>Ortmann, Mark</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39741"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39741/1/Brandes_0-419565.pdf"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-02T13:14:04Z</dc:date>
    <dc:language>eng</dc:language>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39741/1/Brandes_0-419565.pdf"/>
    <dcterms:abstract xml:lang="eng">Centrality indices assign values to the vertices of a graph such that vertices with higher values are considered more central. Triggered by a recent result on the preservation of the vicinal preorder in rankings obtained from common centrality indices, we review and extend notions of domination among vertices. These may serve as building blocks for new concepts of centrality that extend more directly, and more coherently, to more general types of data such as multilayer networks. We also give efficient algorithms to construct the associated partial rankings.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Müller, Julian</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen