Social Network Algorithms and Software

Brandes, Ulrik

Social Network Algorithms and Software

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2015

Publikationstyp

Beitrag zu einem Sammelband

Erschienen in

International encyclopedia of the social and behavioral sciences / James Wright (Hrsg.). - 2. Edition. - Amsterdam : Elsevier, 2015. - S. 454-460. - ISBN 978-0-08-097087-5

Zusammenfassung

Graph-theoretic concepts feature prominently in network analysis because they facilitate the exploration and assessment of structural properties in intuitive terms. However, they also pose algorithmic challenges not normally encountered in population statistics and attribute-based data analysis. We review efficient combinatorial algorithms for core problems of social network analysis and discuss important aspects of software for these tasks.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Algorithms, Centrality, Cliques, Clustering, Complexity, Cores, Density, Equivalence, Graphical representations, Social networks

Zitieren

ISO 690

BRANDES, Ulrik, 2015. Social Network Algorithms and Software. In: JAMES WRIGHT, , ed.. International encyclopedia of the social and behavioral sciences. 2. Edition. Amsterdam:Elsevier, pp. 454-460. ISBN 978-0-08-097087-5. Available under: doi: 10.1016/B978-0-08-097086-8.43121-1

BibTex

@incollection{Brandes2015Socia-31432,
  year={2015},
  doi={10.1016/B978-0-08-097086-8.43121-1},
  title={Social Network Algorithms and Software},
  edition={2. Edition},
  isbn={978-0-08-097087-5},
  publisher={Elsevier},
  address={Amsterdam},
  booktitle={International encyclopedia of the social and behavioral sciences},
  pages={454--460},
  editor={James Wright},
  author={Brandes, Ulrik}
}

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/31432">
    <dcterms:issued>2015</dcterms:issued>
    <dcterms:title>Social Network Algorithms and Software</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/31432"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">Graph-theoretic concepts feature prominently in network analysis because they facilitate the exploration and assessment of structural properties in intuitive terms. However, they also pose algorithmic challenges not normally encountered in population statistics and attribute-based data analysis. We review efficient combinatorial algorithms for core problems of social network analysis and discuss important aspects of software for these tasks.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-07-15T09:55:04Z</dcterms:available>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-07-15T09:55:04Z</dc:date>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja