Publikation: Fixed Parameter Algorithms on Planar Graphs
Lade...
Dateien
Datum
2002
Autor:innen
Köpf, Boris Alexander
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Masterarbeit/Diplomarbeit
Publikationsstatus
Published
Erschienen in
Zusammenfassung
A recently developed tool for designing subexponential fixed parameter algorithms for a class of NP-complete planar graph problems is presented. In this thesis it is extended to cover problems such as Planar Dominating Set and Planar Edge Dominating Set. Furthermore, a sufficient condition for the applicability of the extended method is stated and proven.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
KÖPF, Boris Alexander, 2002. Fixed Parameter Algorithms on Planar Graphs [Master thesis]BibTex
@mastersthesis{Kopf2002Fixed-706, year={2002}, title={Fixed Parameter Algorithms on Planar Graphs}, author={Köpf, Boris Alexander} }
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/706"> <dc:contributor>Köpf, Boris Alexander</dc:contributor> <dc:format>application/pdf</dc:format> <dc:language>eng</dc:language> <dc:creator>Köpf, Boris Alexander</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/706/1/Diplom.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:abstract xml:lang="eng">A recently developed tool for designing subexponential fixed parameter algorithms for a class of NP-complete planar graph problems is presented. In this thesis it is extended to cover problems such as Planar Dominating Set and Planar Edge Dominating Set. Furthermore, a sufficient condition for the applicability of the extended method is stated and proven.</dcterms:abstract> <dcterms:title>Fixed Parameter Algorithms on Planar Graphs</dcterms:title> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:34Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dcterms:issued>2002</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:34Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/706/1/Diplom.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/706"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> </rdf:Description> </rdf:RDF>