The complexity of detecting fixed-density clusters

Holzapfel, Klaus; Kosub, Sven; Maaß, Moritz G.; Täubig, Hanjo

The complexity of detecting fixed-density clusters

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2006

Autor:innen

Holzapfel, Klaus

Kosub, Sven

Maaß, Moritz G.

Täubig, Hanjo

DOI (zitierfähiger Link)

https://doi.org/10.1016/j.dam.2006.01.005

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Discrete Applied Mathematics. 2006, 154(11), pp. 1547-1562. ISSN 0166-218X. eISSN 1872-6771. Available under: doi: 10.1016/j.dam.2006.01.005

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Density-based clustering, Computational complexity, Graph algorithms, Fixed-parameter problems

Zitieren

ISO 690

HOLZAPFEL, Klaus, Sven KOSUB, Moritz G. MAASS, Hanjo TÄUBIG, 2006. The complexity of detecting fixed-density clusters. In: Discrete Applied Mathematics. 2006, 154(11), pp. 1547-1562. ISSN 0166-218X. eISSN 1872-6771. Available under: doi: 10.1016/j.dam.2006.01.005

BibTex

@article{Holzapfel2006-07compl-44944,
  year={2006},
  doi={10.1016/j.dam.2006.01.005},
  title={The complexity of detecting fixed-density clusters},
  number={11},
  volume={154},
  issn={0166-218X},
  journal={Discrete Applied Mathematics},
  pages={1547--1562},
  author={Holzapfel, Klaus and Kosub, Sven and Maaß, Moritz G. and Täubig, Hanjo}
}

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/44944">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-08T13:40:43Z</dc:date>
    <dc:creator>Täubig, Hanjo</dc:creator>
    <dcterms:issued>2006-07</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-08T13:40:43Z</dcterms:available>
    <dc:creator>Kosub, Sven</dc:creator>
    <dc:contributor>Holzapfel, Klaus</dc:contributor>
    <dc:creator>Holzapfel, Klaus</dc:creator>
    <dc:contributor>Täubig, Hanjo</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Kosub, Sven</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44944"/>
    <dc:contributor>Maaß, Moritz G.</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Maaß, Moritz G.</dc:creator>
    <dcterms:title>The complexity of detecting fixed-density clusters</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein

Begutachtet

Unbekannt