Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/4006
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZeynep Sargut F.-
dc.contributor.authorAhuja R.K.-
dc.contributor.authorOrlin J.B.-
dc.contributor.authorMagnanti T.L.-
dc.date.accessioned2023-06-16T15:06:37Z-
dc.date.available2023-06-16T15:06:37Z-
dc.date.issued2016-
dc.identifier.isbn9781420011074-
dc.identifier.isbn9781584885955-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/4006-
dc.description.abstract[No abstract available]en_US
dc.language.isoenen_US
dc.publisherCRC Pressen_US
dc.relation.ispartofHandbook of Graph Theory, Combinatorial Optimization, and Algorithmsen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleMaximum flow problemen_US
dc.typeBook Parten_US
dc.identifier.scopus2-s2.0-85051755171en_US
dc.authorscopusid37762535700-
dc.authorscopusid7005104771-
dc.authorscopusid7003623628-
dc.identifier.startpage79en_US
dc.identifier.endpage111en_US
dc.relation.publicationcategoryKitap Bölümü - Uluslararasıen_US
dc.identifier.scopusqualityN/A-
dc.identifier.wosqualityN/A-
item.openairetypeBook Part-
item.cerifentitytypePublications-
item.grantfulltextreserved-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Files in This Item:
File SizeFormat 
(Chapman & Hall_CRC computer and information science series) Arumugam, S._ Brandstädt, Andreas_ Nishizeki, Takao_ Thulasiraman, K - Handbook of graph theory, combinatorial optimization, and algorithms(1).pdf
  Restricted Access		585.42 kBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

Page view(s)

92
checked on Nov 25, 2024

Download(s)

6
checked on Nov 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.