Handling Proper Minor-Closed Graph Classes in Linear Time : Shortest Paths and 2-Approximate Steiner Trees / Matthias Müller-Hannemann; Siamak Tazari

Kurzanzeige
cbs.date.changed2021-07-07
cbs.date.creation2009-04-02
cbs.picatypeOa
cbs.publication.displayformHalle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2007
dc.contributor.authorMüller-Hannemann, Matthias
dc.contributor.authorTazari, Siamak
dc.date.accessioned2025-06-02T12:52:03Z
dc.date.issued2007
dc.format.extentOnline-Ressource (PDF-Datei: 21 S., 0,24 MB) : graph. Darst.
dc.genrebook
dc.identifier.ppn595648134
dc.identifier.urihttps://epflicht.bibliothek.uni-halle.de/handle/123456789/15681
dc.identifier.urnurn:nbn:de:gbv:3:2-8308
dc.identifier.vl-id89720
dc.language.isoeng
dc.publisherMartin-Luther-University Halle-Wittenberg, Institute of Computer Science
dc.relation.ispartofseriesTechnische Berichte ; 2007,5 ppn:584751885
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004
dc.titleHandling Proper Minor-Closed Graph Classes in Linear Time : Shortest Paths and 2-Approximate Steiner Trees / Matthias Müller-Hannemann; Siamak Tazari
dc.typeBook
dspace.entity.typeMonograph
local.accessrights.itemAnonymous
local.openaccesstrue

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
urn_nbn_de_gbv_3_2-8308.pdf
Größe:
245.23 KB
Format:
Adobe Portable Document Format
Beschreibung:
Handling Proper Minor-Closed Graph Classes in Linear Time
Herunterladen

Sammlungen

E-Book