Centrality in Policy Network Drawings : (Extended Abstract)

Brandes, Ulrik; Kenis, Patrick; Wagner, Dorothea

Centrality in Policy Network Drawings : (Extended Abstract)

Dateien

bkw_cpnd_99.pdf(96.2 KB)

Datum

2000

Autor:innen

Brandes, Ulrik

Kenis, Patrick

Wagner, Dorothea

Publikationstyp

Beitrag zu einem Konferenzband

Erschienen in

Graph Drawing / Kratochvíyl, Jan (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2000. - (Lecture Notes in Computer Science ; 1731). - S. 250-258. - ISBN 978-3-540-66904-3

Zusammenfassung

We report on first results of a cooperation aiming at the usage of graph drawing techniques to convey domain-specific information contained in policy or, more general, social networks. Policy network analysis is an approach to study policy making processes, structures and outcomes, thereby concentrating on the analysis of relations between policy actors. An important operational concept for the analysis of policy networks is centrality, i.e. the distinction of actors according to their importance in a relational structure. Matching structural with geometric centrality we incorporate the aggregated values of centrality measures into a layout model of the network.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

BRANDES, Ulrik, Patrick KENIS, Dorothea WAGNER, 2000. Centrality in Policy Network Drawings : (Extended Abstract). In: KRATOCHVÍYL, Jan, ed.. Graph Drawing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 250-258. ISBN 978-3-540-66904-3. Available under: doi: 10.1007/3-540-46648-7_26

BibTex

@inproceedings{Brandes2000-03-03Centr-5763,
  year={2000},
  doi={10.1007/3-540-46648-7_26},
  title={Centrality in Policy Network Drawings : (Extended Abstract)},
  number={1731},
  isbn={978-3-540-66904-3},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing},
  pages={250--258},
  editor={Kratochvíyl, Jan},
  author={Brandes, Ulrik and Kenis, Patrick and Wagner, Dorothea}
}

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/5763">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5763"/>
    <dcterms:title>Centrality in Policy Network Drawings : (Extended Abstract)</dcterms:title>
    <dc:creator>Kenis, Patrick</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dcterms:available>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:abstract xml:lang="eng">We report on first results of a cooperation aiming at the usage of graph drawing techniques to convey domain-specific information contained in policy or, more general, social networks. Policy network analysis is an approach to study policy making processes, structures and outcomes, thereby concentrating on the analysis of relations between policy actors. An important operational concept for the analysis of policy networks is centrality, i.e. the distinction of actors according to their importance in a relational structure. Matching structural with geometric centrality we incorporate the aggregated values of centrality measures into a layout model of the network.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:contributor>Kenis, Patrick</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 7th International Symposium on Graph Drawing (GD ´99) (LNCS 1731), 1999, pp. 250-258</dcterms:bibliographicCitation>
    <dc:format>application/pdf</dc:format>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5763/1/bkw_cpnd_99.pdf"/>
    <dcterms:issued>2000-03-03</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <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">2011-03-24T15:59:54Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5763/1/bkw_cpnd_99.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein