| Presentation | 2010-04-22 Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings Takuro FUKUNAGA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into k connected components. We present an algorithm for this problem which runs in strongly polynomial-time if both k and the rank of the hypergraph are constants. Our algorithm extends the algorithm due to Thorup (2008) for computing minimum k-cuts of graphs from greedy packings of spanning trees. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | fixed parametar tractability / hypergraph / multiway cut / tree packing |
| Paper # | COMP2010-8 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2010/4/15(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings |
| Sub Title (in English) | |
| Keyword(1) | fixed parametar tractability |
| Keyword(2) | hypergraph |
| Keyword(3) | multiway cut |
| Keyword(4) | tree packing |
| 1st Author's Name | Takuro FUKUNAGA |
| 1st Author's Affiliation | Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University() |
| Date | 2010-04-22 |
| Paper # | COMP2010-8 |
| Volume (vol) | vol.110 |
| Number (no) | 12 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |