The complexity of detecting fixed-density clusters

No Thumbnail Available
Files
There are no files associated with this item.
Date
2006
Authors
Holzapfel, Klaus
Maaß, Moritz G.
Täubig, Hanjo
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
10.1016/j.dam.2006.01.005
ArXiv-ID
International patent number
Link to the license
oops
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
Published in
Discrete Applied Mathematics ; 154 (2006), 11. - pp. 1547-1562. - ISSN 0166-218X. - eISSN 1872-6771
Abstract
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Density-based clustering, Computational complexity, Graph algorithms, Fixed-parameter problems
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690HOLZAPFEL, Klaus, Sven KOSUB, Moritz G. MAASS, Hanjo TÄUBIG, 2006. The complexity of detecting fixed-density clusters. In: Discrete Applied Mathematics. 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>
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
No
Refereed
Unknown