Pascal and Francis Bibliographic Databases

Help

Permanent link : http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13842510

Export

Selection :

Approximation of pathwidth of outerplanar graphs

Author
BODLAENDER, Hans L1 ; FOMIN, Fedor V2
[1] Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, Netherlands
[2] Graduiertenkolleg des PaSCo, Heinz Nixdorf Institut and University of Paderborn, Fürstenallee 11, 33102 Paderborn, Germany
Source

Journal of algorithms (Print). 2002, Vol 43, Num 2, pp 190-200 ; ref : 10 ref

CODEN
JOALDV
ISSN
0196-6774
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, San Diego, CA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme approximation Graphe connexe Graphe planaire Temps polynomial Outerplanar graph Pathwidth Treewidth
Keyword (en)
Approximation algorithm Connected graph Planar graph Polynomial time
Keyword (es)
Algoritmo aproximación Grafo conexo Grafo planario Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
13842510

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web