Vertex bisection is hard, too

Thumbnail Image
Files
Brandes_opus-104018.pdf(356.18 KB)
Date
2009
Authors
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
urn:nbn:de:bsz:352-opus-104018
DOI (citable link)
10.7155/jgaa.00179
ArXiv-ID
International patent number
Link to the license
In Copyright
EU project number
Project
Open Access publication
Collections
Informatik und Informationswissenschaft
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Journal article
Publication status
Published in
Journal of Graph Algorithms and Applications ; 13 (2009), 2. - pp. 119-131
Abstract
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
algo
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690BRANDES, Ulrik, Daniel FLEISCHER, 2009. Vertex bisection is hard, too. In: Journal of Graph Algorithms and Applications. 13(2), pp. 119-131. Available under: doi: 10.7155/jgaa.00179
BibTex
@article{Brandes2009Verte-2971,
  year={2009},
  doi={10.7155/jgaa.00179},
  title={Vertex bisection is hard, too},
  number={2},
  volume={13},
  journal={Journal of Graph Algorithms and Applications},
  pages={119--131},
  author={Brandes, Ulrik and Fleischer, Daniel}
}
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/2971">
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>2009</dcterms:issued>
    <dcterms:title>Vertex bisection is hard, too</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:32Z</dcterms:available>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/2971"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Fleischer, Daniel</dc:contributor>
    <dcterms:bibliographicCitation>Publ. in: Journal of Graph Algorithms and Applications 13 (2009), 2, pp. 119-131</dcterms:bibliographicCitation>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/2971/1/Brandes_opus-104018.pdf"/>
    <dc:creator>Fleischer, Daniel</dc:creator>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:32Z</dc:date>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/2971/1/Brandes_opus-104018.pdf"/>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed