The Steiner tree problem; a tour through graphs, algorithms, and complexity

By:

Contributor(s):

Material type: Text

TextSeries: Advanced lectures in MathematicsPublication details: Wiesbaden Vieweg 2002Description: viii, 241p. Bibl. IndexISBN:

Subject(s):

DDC classification:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Notes	Date due	Barcode
Book	ISID	511.5 P965.ST (Browse shelf(Opens below))	Available	Ord num:6258; Ord dt:2002-07-11		DP25371

Previous							No cover image available	Next
Previous	511.5 P281.TM Topological methods in data analysis and visualization	511.5 P417.RG Random geometric graphs /	511.5 P768.DM Discrete mathematics /	511.5 P965.ST The Steiner tree problem; a tour through graphs, algorithms, and complexity	511.5 R173.PG Perfect graphs /	511.5 R284.AG An atlas of graphs	511.5 R581.MC Map color theorem	Next

There are no comments on this title.

to post a comment.

Back to results