Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Shortest m-Watchmen Routes for Histograms: The...
Conference

Shortest m-Watchmen Routes for Histograms: The MinMax Case.

Authors

Nilsson BJ; Schuierer S

Editors

Koczkodaj WW; Lauer PE; Toptsis AA

Pagination

pp. 30-33

Publisher

IEEE Computer Society

Publication Date

1992

ISBN-10

0-8186-2812-X

Conference proceedings

ICCI