Integrated Research on Connectivity of Graphs

本项目的主要目的是促进关于图的连通性及其应用的理论刻画和实用算法设计的研究.研究结果（1）当每个顶点都有一个顶点度的上融合时，构造一个具有给定连通度的最小图（2006年和2007年各1篇论文）。(2)用于构建具有指定连通性的最小成本图的快速算法（2006年1篇论文）。(3)图的最大代价配对铰链的快速算法（2006年1篇，2007年2篇）。(4)边权值变化后重构最短路径树的快速算法（2006年2篇论文）。(5)提取生成平面子图的精确算法（2006年1篇论文）。(6)Steiner树及其并行化的有效构建（2006年和2007年各1篇论文）。(7)图着色的快速算法（2007年3篇论文）。(8)图的顶点覆盖的尖锐而快速的算法（2007年1篇论文）。(9)重新筛选 ...更多信息 ch on Petri nets（a concrete model of vector-addition systems）（4 papers in 2007）2.研究促进活动在广岛大学学习会馆举办两次关于图形连通性的讲习班式研讨会（每个财政年度一次），在演讲后进行深入讨论。(1)【日期】：2007年1月31日至2月2日[参加者]：京都大学的Hiroshi Nagamochi教授、Hiro Ito教授和Talcum Fukunaga教授、东京大学的Kazuhisa Makino教授、广岛国际大学的Toshiya Mashima教授、广岛大学的Toshimasa Watanabe教授、Satoshi Taoka教授和Daisuke Takafuji教授、匈牙利Eotvos Lorand University的Tibor Jordan教授和Tam\as Kiraly教授（2）[日期]：Mrch 10-March 12，2008[参与者]：京都大学的伊藤教授、福永敏明教授、杉原贯也博士、东京大学的牧野和久教授、小樽商业大学的石井俊正教授、广岛国际大学的真岛俊哉教授、渡边俊正教授、广岛大学的Satoshi Taoka教授和Daisuke Takafuji教授匈牙利Eotvos Lorand大学的Thor Jordan教授和Remits Kiraly教授减

The subject of this project is to promote research on theoretical characterization and designing practical algorithms concerning connectivity of graphs and its applications.1. Research results(1) Constructing a minimum graph with presented connectivity when each vertex has an upper blend on vertex degree (1 paper in each of 2006 and 2007).(2) Sharp and fast algorithms for constructing a minimum-cost graph with prescribed connectivity (1 paper in 2006).(3) Fast algorithms for maximum-cost mate-hinge of graphs (1 paper in 2006 and 2 papers in 2007).(4) Fast algorithms for reconstructing shortest path tress after change in edge weights (2 papers in 2006).(5) Sharp algorithms for extracting spanning planar subgraphs (1 paper in 2006).(6) Efficient construction of Steiner trees and their parallelization (1 paper in each of 2006 and 2007).(7) Sharp and fast algorithms for graph coloring (3 papers in 2007).(8) Sharp and fast algorithms for vertex covers of graphs (1 Paper in 2007).(9) Resear … More ch on Petri nets (a concrete model of vector-addition systems)(4 papers in 2007)2. Research promoting activityHolding two workshop-type seminars (one for each fiscal year) on connectivity of graphs, with presentation followed by intensive discussion at Gakushi-Kaikan, Hiroshima University.(1) [Date]: January 31-February 2, 2007[Participants]: Prof Hiroshi Nagamochi, Prof Hiro Ito and Prof Talcum Fukunaga of Kyoto University, Prof Kazuhisa Makino of Tokyo University, Prof Toshiya Mashima of Hiroshima International University, Prof Toshimasa Watanabe, Prof Satoshi Taoka and Prof Daisuke Takafuji of Hiroshirma University, Prof Tibor Jordan and Prof Tam\as Kiraly of Eotvos Lorand University Hungary(2) [Date]: Mrch 10-March 12, 2008[Participants]: Prof Him Ito and Prof minim Fukunaga and Dr. Kannya Sugihara of Kyoto University, Prof Kazuhisa Makino of Tokyo University, Prof Toshimasa Ishii of Otaru University of Commerce, Prof Toshiya Mashima of Hiroshima International University Prof Toshimasa Watanabe, Prof Satoshi Taoka and Prof Daisuke Takafuji of Hiroshima University Prof Thor Jordan and Prof remits Kiraly of Eotvos Lorand University, Hungary Less