Forskning ved Københavns Universitet - Københavns Universitet

Forside

Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries

Publikation: Working paperForskning

Standard

Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries. / Alstrup, Stephen; Rauhe, Theis.

2001.

Publikation: Working paperForskning

Harvard

Alstrup, S & Rauhe, T 2001 'Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries'.

APA

Alstrup, S., & Rauhe, T. (2001). Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries.

Vancouver

Alstrup S, Rauhe T. Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries. 2001.

Author

Alstrup, Stephen ; Rauhe, Theis. / Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries. 2001.

Bibtex

@techreport{c09fcc2df38d4571bcc1b42eed4639d5,
title = "Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries",
author = "Stephen Alstrup and Theis Rauhe",
year = "2001",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries

AU - Alstrup, Stephen

AU - Rauhe, Theis

PY - 2001

Y1 - 2001

M3 - Working paper

BT - Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries

ER -

ID: 84717829