Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Minimum k-connected geometric networks

Tools
- Tools
+ Tools

Czumaj, Artur and Lingas, Andrzej (2008) Minimum k-connected geometric networks. In: Kao, Ming-Yang, (ed.) Encyclopedia of algorithms. Springer Verlag, pp. 536-539. ISBN 9780387301624

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1007/978-0-387-30162-4_237

Request Changes to record.

Item Type: Book Item
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Publisher: Springer Verlag
ISBN: 9780387301624
Book Title: Encyclopedia of algorithms
Editor: Kao, Ming-Yang
Official Date: 2008
Dates:
DateEvent
2008Published
Page Range: pp. 536-539
DOI: 10.1007/978-0-387-30162-4_237
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Related URLs:
  • http://webcat.warwick.ac.uk/record=b2248...

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us