講演番号 | 題目/著者 |
---|---|
AS-1-1 | 研究会の新たな共催に対するグラフ的考察 ○金子美博, |
AS-1-2 | 代数的連結度最大グラフに関する一定理の拡張 ◎石井涼也, 高橋規一, |
AS-1-3 | A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs ○Yuta Inaba, Satoshi Tayu, Shuichi Ueno, |
AS-1-4 | On the Three-Dimensional Routing ◎Hiroyuki Gunji, Satoshi Tayu, Shuichi Ueno, |
AS-1-5 | A Note on the Spanning Subgraph Isomorphism Problem ◎Kenji Ichikawa, Satoshi Tayu, Shuichi Ueno, |
AS-1-6 | A Polynomial-Time Algorithm for a Variation of the 2-Chain Subgraph Cover Problem Related to the Recognition of Simple-Triangle Graphs ○Asahi TAKAOKA, |
AS-1-7 | Multiple Leader Election in Clustered Graph for Distributed Network Control ○Hideki Shindo, Norihiko Shinomiya, |