h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

A New Algorithm for Finding Trees with Many Leaves

; ;

VerantwortlichkeitsangabeJoachium Kneis ...

ImpressumAachen : RWTH Aachen, Department of Computer Science

Umfang19 S.

ReiheAachener Informatik Berichte ; 2008,15

Report-Nr.AIB-2008-15

Online
URL: http://sunsite.informatik.rwth-aachen.de/Publications/AIB/2008/2008-15.pdf

Einrichtungen

  1. Lehr- und Forschungsgebiet Theoretische Informatik (121220)
  2. Fachgruppe Informatik (120000)


Inhaltliche Beschreibung (Schlagwörter)
Exact Algorithms (frei) ; Parameterized Complexity (frei) ; Maximum Leaf Trees (frei)

External link:
Download fulltext
Fulltext

Dokumenttyp
Report

Format
online, print

Sprache
English

Interne Identnummern
RWTH-CONV-008351
Datensatz-ID: 47970

Beteiligte Länder
Germany

 GO


QR Code for this record

The record appears in these collections:
Document types > Reports > Reports
Faculty of Computer Science (Fac.9)
Public records
Publications database
120000
121220

 Record created 2013-01-25, last modified 2022-08-02


External link:
Download fulltext
Fulltext
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)