IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2005-06-24 16:00
A Deterministic Algorithm for Finding All Minimum k-Way Cuts
Yoko Kamidoi, Noriyoshi Yoshida (Hiroshima City Univ.), Hiroshi Nagamochi (Kyoto Univ.)
Abstract (in Japanese) (See Japanese page) 
(in English) Let $G=(V,E)$ be an edge-weighted
undirected graph with $n$ vertices and $m$ edges.
We present a deterministic algorithm to compute
a minimum $k$-way cut of $G$ for a given $k$.
Our algorithm is a divide-and-conquer method
based on a procedure that reduces
an instance of the minimum $k$-way cut problem
to $O(n^{2k-5})$ instances
of the minimum $(\lfloor (k+\sqrt{k})/2\rfloor+1)$-way cut problem,
and can be implemented to run in
$O(n^{4k/(1-1.71/\sqrt{k}) -31} )$ time.
With a slight modification,
the algorithm can find all minimum $k$-way cuts in
$O(n^{4k/(1-1.71/\sqrt{k}) -16} )$ time.
Keyword (in Japanese) (See Japanese page) 
(in English) minimum cut / multiway cut / divide-and-conquer / / / / /  
Reference Info. IEICE Tech. Rep., vol. 105, no. 144, COMP2005-26, pp. 51-58, June 2005.
Paper # COMP2005-26 
Date of Issue 2005-06-17 (COMP) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee COMP  
Conference Date 2005-06-24 - 2005-06-24 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2005-06-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Deterministic Algorithm for Finding All Minimum k-Way Cuts 
Sub Title (in English)  
Keyword(1) minimum cut  
Keyword(2) multiway cut  
Keyword(3) divide-and-conquer  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yoko Kamidoi  
1st Author's Affiliation Hiroshima City University (Hiroshima City Univ.)
2nd Author's Name Noriyoshi Yoshida  
2nd Author's Affiliation Hiroshima City University (Hiroshima City Univ.)
3rd Author's Name Hiroshi Nagamochi  
3rd Author's Affiliation Kyoto University (Kyoto Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2005-06-24 16:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2005-26 
Volume (vol) vol.105 
Number (no) no.144 
Page pp.51-58 
#Pages
Date of Issue 2005-06-17 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan