Centrality in Policy Network Drawings : (Extended Abstract)
Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können derzeit keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted currently.)
| Type of Publication: | Contribution to a conference collection |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-77744 |
| Author: | Brandes, Ulrik; Kenis, Patrick; Wagner, Dorothea |
| Year of publication: | 2000 |
| Published in: | Graph Drawing / Kratochvíyl, Jan (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2000. - (Lecture Notes in Computer Science ; 1731). - pp. 250-258. - ISBN 978-3-540-66904-3 |
| DOI (citable link): | https://dx.doi.org/10.1007/3-540-46648-7_26 |
| Summary: |
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.
|
| Subject (DDC): | 004 Computer Science |
| Link to License: | In Copyright |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
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
@inproceedings{Brandes2000-03-03Centr-5763, title={Centrality in Policy Network Drawings : (Extended Abstract)}, year={2000}, doi={10.1007/3-540-46648-7_26}, number={1731}, isbn={978-3-540-66904-3}, address={Berlin, Heidelberg}, publisher={Springer 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 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/rdf/resource/123456789/5763"> <dc:creator>Brandes, Ulrik</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5763/1/bkw_cpnd_99.pdf"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dc:date> <dcterms:issued>2000-03-03</dcterms:issued> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 7th International Symposium on Graph Drawing (GD ´99) (LNCS 1731), 1999, pp. 250-258</dcterms:bibliographicCitation> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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> <dc:creator>Kenis, Patrick</dc:creator> <dcterms:title>Centrality in Policy Network Drawings : (Extended Abstract)</dcterms:title> <dc:contributor>Wagner, Dorothea</dc:contributor> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5763/1/bkw_cpnd_99.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5763"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:format>application/pdf</dc:format> <dc:contributor>Kenis, Patrick</dc:contributor> </rdf:Description> </rdf:RDF>
Downloads since Oct 1, 2014 (Information about access statistics)
| bkw_cpnd_99.pdf | 370 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
