On computing a longest path in a tree

Eindhoven Tuesday Afternoon Club

doi:10.1016/S0020-0190(01)00198-3

On computing a longest path in a tree

Eindhoven Tuesday Afternoon Club

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

42 Citaten (Scopus)

3 Downloads (Pure)

Originele taal-2	Engels
Pagina's (van-tot)	93-96
Tijdschrift	Information Processing Letters
Volume	81
Nummer van het tijdschrift	2
DOI's	https://doi.org/10.1016/S0020-0190(01)00198-3
Status	Gepubliceerd - 2002

Toegang tot document

10.1016/S0020-0190(01)00198-3

Citeer dit

@article{c88df472a2b344ff9f15c15b70e15d11,

title = "On computing a longest path in a tree",

author = "{Eindhoven Tuesday Afternoon Club} and R.W. Bulterman and {Sommen, van der}, F.W. and G. Zwaan and T. Verhoeff and {Gasteren, van}, A.J.M. and W.H.J. Feijen",

year = "2002",

doi = "10.1016/S0020-0190(01)00198-3",

language = "English",

volume = "81",

pages = "93--96",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - On computing a longest path in a tree

AU - Eindhoven Tuesday Afternoon Club

AU - Bulterman, R.W.

AU - Sommen, van der, F.W.

AU - Zwaan, G.

AU - Verhoeff, T.

AU - Gasteren, van, A.J.M.

AU - Feijen, W.H.J.

PY - 2002

Y1 - 2002

U2 - 10.1016/S0020-0190(01)00198-3

DO - 10.1016/S0020-0190(01)00198-3

M3 - Article

SN - 0020-0190

VL - 81

SP - 93

EP - 96

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -