Image from Google Jackets

Normal view MARC view ISBD view

Algorithmic aspects of graph connectivity Hiroshi Nagamochi

By:

Nagamochi, Hiroshi

Contributor(s):

Ibaraki, Toshihde

Material type: Text

Text

TextSeries: Encyclopedia of Mathematics and its Applications; 123 | Doran, RPublication details: Cambridge University Press 2008 CambridgeDescription: xv, 375pISBN:

9780521878647

Subject(s):

Graph algorithms

DDC classification:

511.5 N1313a

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
REF	Central Library Reference	Mathematics	511.5 N1313a (Browse shelf(Opens below))	Available		8064

Total holds: 0

Browsing Central Library shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.5 G585a Algorithmic graph theory and perfect graphs	511.5 G9141h Handbook of graph theory	511.5 M3342G Graph theory a problem oriented approach	511.5 N1313a Algorithmic aspects of graph connectivity	511.5 T428g Graphs theory and algorithms	511.6 Al721t Probabilistic method	511.6 D613c Codes from difference sets Cunsheng Ding	Next

There are no comments on this title.

to post a comment.