Show simple item record

dc.contributor.authorKfoury, Assafen_US
dc.date2013-11-23en_US
dc.date.accessioned2015-06-24T19:48:56Z
dc.date.available2015-06-24T19:48:56Z
dc.date.issued2013-11-25en_US
dc.identifier.citationKfoury, Assaf. "A Compositional Approach to Network Algorithms", Technical Report BUCS-TR-2013-015, Computer Science Department, Boston University, November 23, 2013. [Available from: http://hdl.handle.net/2144/11423]en_US
dc.identifier.urihttps://hdl.handle.net/2144/11423
dc.description.abstractWe present elements of a typing theory for flow networks, where “types”, “typings”, and “type inference” are formulated in terms of familiar notions from polyhedral analysis and convex optimization. Based on this typing theory, we develop an alternative approach to the design and analysis of network algorithms, which we illustrate by applying it to the max-flow problem in multiple-source, multiple-sink, capacited directed planar graphs.en_US
dc.description.sponsorshipNational Science Foundation (CCF-0820138, CNS-1135722)en_US
dc.language.isoen_USen_US
dc.publisherComputer Science Department, Boston Universityen_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2013-015en_US
dc.titleA compositional approach to network algorithmsen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record