Vertex bisection is hard, too

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:eb4cff6a0b7f9557e27bb77a5eb4ca50

BRANDES, Ulrik, Daniel FLEISCHER, 2009. Vertex bisection is hard, too. In: Journal of Graph Algorithms and Applications. 13(2), pp. 119-131

@article{Brandes2009Verte-2971, title={Vertex bisection is hard, too}, year={2009}, doi={10.7155/jgaa.00179}, number={2}, volume={13}, journal={Journal of Graph Algorithms and Applications}, pages={119--131}, author={Brandes, Ulrik and Fleischer, Daniel} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/2971"> <dcterms:issued>2009</dcterms:issued> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Fleischer, Daniel</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:bibliographicCitation>Publ. in: Journal of Graph Algorithms and Applications 13 (2009), 2, pp. 119-131</dcterms:bibliographicCitation> <dc:contributor>Fleischer, Daniel</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:32Z</dcterms:available> <dcterms:title>Vertex bisection is hard, too</dcterms:title> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:32Z</dc:date> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/2971"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Brandes_opus-104018.pdf 112

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto