Algorithmic analysis of large networks by computing structural indices

Cite This

Files in this item

Checksum: MD5:db53a8db6ed5db89be62c01513b5114e

GULDEN, Christoph, 2004. Algorithmic analysis of large networks by computing structural indices [Master thesis]

@mastersthesis{Gulden2004Algor-580, title={Algorithmic analysis of large networks by computing structural indices}, year={2004}, author={Gulden, Christoph} }

<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/580"> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/580/1/diplomArbeit.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:07Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/580"/> <dc:contributor>Gulden, Christoph</dc:contributor> <dcterms:title>Algorithmic analysis of large networks by computing structural indices</dcterms:title> <dc:language>eng</dc:language> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:07Z</dc:date> <dc:format>application/pdf</dc:format> <dcterms:issued>2004</dcterms:issued> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Gulden, Christoph</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/580/1/diplomArbeit.pdf"/> <dcterms:abstract xml:lang="eng">We present suitable design patterns and basic algorithms and use them to discuss the computation of popular network indices. With methods from discrete statistics, we are able to visualize and summarize these results for large networks. Furthermore, we talk about heuristic speed-up and approximation techniques to handle even networks that are too large to get the correct results in an acceptable time.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

diplomArbeit.pdf 173

This item appears in the following Collection(s)

Search KOPS


Browse

My Account