Art

J-GLOBAL ID：200902249170142365   Reference number：05A0408698

Another Simple Algorithm for Edge-Coloring Bipartite Graphs

辺彩色二部グラフに対するもう一つの単純なアルゴリズム

Author (1)： TAKABATAKE Takashi (Kochi Gakuen Coll., Kochi-shi, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E88-A  Issue： 5  Page： 1303-1304  Publication year： May. 01, 2005 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： graph theory ,...
Semi thesaurus term： computational complexity ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=05A0408698&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (1)： Basics of graph theory  (IA02020S)

Reference (7)：

• ALON, N. A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 2003, 85, 301-302
• COLE, R. On edge coloring bipartite graphs. SIAM J. Comput. 1982, 11, 540-546
• COLE, R. Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica. 2001, 21, 5-12
• GABOW, H. Using Euler partitions to edge color bipartite multigraphs. Int. J. Comput. Inf. Sci. 1976, 5, 345-355
• KAPOOR, A. Edge-coloring bipartite graphs. Journal of Algorithms. 2000, 34, 390-396

Terms in the title (4)： 辺 ,  彩色 ,  二部グラフ ,  アルゴリズム