Skip navigation
Skip navigation

Finding a Low-Diameter and Low-Weight k-Connected Subgraph

CollectionsANU Research Publications
Date published: 1999
Type: Journal article
URI: http://hdl.handle.net/1885/91584
Source: Congressus Numerantium

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator