講演抄録/キーワード |
講演名 |
2008-06-16 16:10
無向グラフのk点連結性の検査 ○吉田悠一・伊藤大雄(京大) COMP2008-22 |
抄録 |
(和) |
We present an algorithm for testing $k$-vertex-connectivity of graphs with given maximum degree. The time complexity of the algorithm is independent to the number of vertices and edges of graphs. It is the first constant-time $k$-vertex-connectivity testing algorithm for general $k\geq 4$.
A graph $G$ with $n$ vertices and maximum degree at most $d$ is called $\epsilon$-far from $k$-vertex-connectivity when at least $\frac{\epsilon dn}{2}$ edges must be added to or removed from $G$ to obtain a $k$-vertex-connected graph with maximum degree at most $d$.
The algorithm always accepts every graph which is $k$-vertex-connected and rejects every graph which is $\epsilon$-far from $k$-vertex-connectivity with probability at least $2/3$. |
(英) |
We present an algorithm for testing $k$-vertex-connectivity of graphs with given maximum degree. The time complexity of the algorithm is independent to the number of vertices and edges of graphs. It is the first constant-time $k$-vertex-connectivity testing algorithm for general $k\geq 4$.
A graph $G$ with $n$ vertices and maximum degree at most $d$ is called $\epsilon$-far from $k$-vertex-connectivity when at least $\frac{\epsilon dn}{2}$ edges must be added to or removed from $G$ to obtain a $k$-vertex-connected graph with maximum degree at most $d$.
The algorithm always accepts every graph which is $k$-vertex-connected and rejects every graph which is $\epsilon$-far from $k$-vertex-connectivity with probability at least $2/3$. |
キーワード |
(和) |
グラフ / 性質検査 / 点連結度 / / / / / |
(英) |
Graph / Property Testing / Vertex Connectivity / / / / / |
文献情報 |
信学技報, vol. 108, no. 89, COMP2008-22, pp. 49-55, 2008年6月. |
資料番号 |
COMP2008-22 |
発行日 |
2008-06-09 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2008-22 |