File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Menger's paths with minimum mergings

TitleMenger's paths with minimum mergings
Authors
Han, G
Issue Date2009
Citation
Proceedings - 2009 Ieee Information Theory Workshop On Networking And Information Theory, Itw 2009, 2009, p. 271-275 How to Cite?
DOI: http://dx.doi.org/10.1109/ITWNIT.2009.5158585
AbstractFor an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number of mergings between these paths is upper bounded by a constant depending only on the min-cuts between the sources and the sinks, regardless of the size and topology of the graph. We also give bounds on the minimum number of mergings between these paths, and discuss how it depends on the min-cuts. © 2009 IEEE.
Description2009 IEEE Information Theory Workshop on Networking and Information Theory
Persistent Identifierhttp://hdl.handle.net/10722/62186
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorHan, Gen_HK
dc.date.accessioned2010-07-13T03:55:48Z-
dc.date.available2010-07-13T03:55:48Z-
dc.date.issued2009en_HK
dc.identifier.citationProceedings - 2009 Ieee Information Theory Workshop On Networking And Information Theory, Itw 2009, 2009, p. 271-275en_HK
dc.identifier.urihttp://hdl.handle.net/10722/62186-
dc.description2009 IEEE Information Theory Workshop on Networking and Information Theoryen_HK
dc.description.abstractFor an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number of mergings between these paths is upper bounded by a constant depending only on the min-cuts between the sources and the sinks, regardless of the size and topology of the graph. We also give bounds on the minimum number of mergings between these paths, and discuss how it depends on the min-cuts. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009en_HK
dc.titleMenger's paths with minimum mergingsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailHan, G:ghan@hku.hken_HK
dc.identifier.authorityHan, G=rp00702en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ITWNIT.2009.5158585en_HK
dc.identifier.scopuseid_2-s2.0-77950650095en_HK
dc.identifier.hkuros156618en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77950650095&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage271en_HK
dc.identifier.epage275en_HK
dc.identifier.scopusauthoridHan, G=8640067800en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats