File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Menger’s Paths with Minimum Mergings: A Generalization of Menger’s Theorem
| Title | Menger’s Paths with Minimum Mergings: A Generalization of Menger’s Theorem |
|---|---|
| Authors | |
| Issue Date | 2010 |
| Citation | Information Theory and Applications Workshop, University of California, San Diego, USA, 31 January - 5 February 2010 How to Cite? |
| Abstract | For 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.
|
| Description | Session: Combinatorial Topics in Coding and Information Theory |
| Persistent Identifier | http://hdl.handle.net/10722/241363 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Han, G | - |
| dc.date.accessioned | 2017-06-08T07:23:15Z | - |
| dc.date.available | 2017-06-08T07:23:15Z | - |
| dc.date.issued | 2010 | - |
| dc.identifier.citation | Information Theory and Applications Workshop, University of California, San Diego, USA, 31 January - 5 February 2010 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/241363 | - |
| dc.description | Session: Combinatorial Topics in Coding and Information Theory | - |
| dc.description.abstract | For 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. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Information Theory and Applications Workshop | - |
| dc.title | Menger’s Paths with Minimum Mergings: A Generalization of Menger’s Theorem | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Han, G: ghan@hku.hk | - |
| dc.identifier.authority | Han, G=rp00702 | - |
| dc.identifier.hkuros | 173840 | - |