Art

J-GLOBAL ID：200902171521735610   Reference number：01A0333568

Graph Augmentation Problems with Degree-Unchangeable Vertices.

次数不変頂点をもつグラフ拡大問題

Author (2)： MASHIMA T (Hiroshima City Univ., Hiroshima-shi, JPN) ,  WATANABE T (Hiroshima Univ., Higashi-Hiroshima-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： E84-A  Issue： 3  Page： 781-793  Publication year： Mar. 01, 2001 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *undirected graph ,...

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

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

Reference (18)：

• ESWARAN, K. P. Augmentation problems. SIAM J. Computing. 1976, 5, 653-665
• EVEN, S. Graph Algorithms. 1979
• HOPCROFT, J. E. Dividing a graph into triconnected components. SIAM J. Comput. 1973, 2, 135-158
• HSU, T. -S. On four-connecting a triconnected graph. Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science. 1992, 70-79
• HSU, T. -S. Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation. Proc. 6th Intl. Symp. on Algorithms and Computation. 1995

Terms in the title (5)： 次数 ,  不変 ,  頂点 ,  グラフ ,  拡大