Paper Abstract and Keywords |
Presentation |
2008-06-16 16:10
Property Testing on k-Vertex-Connectivity of Graphs Yuichi Yoshida, Hiro Ito (Kyoto Univ.) COMP2008-22 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
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$. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Graph / Property Testing / Vertex Connectivity / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 108, no. 89, COMP2008-22, pp. 49-55, June 2008. |
Paper # |
COMP2008-22 |
Date of Issue |
2008-06-09 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2008-22 |
Conference Information |
Committee |
COMP |
Conference Date |
2008-06-16 - 2008-06-16 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
JAIST |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2008-06-COMP |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Property Testing on k-Vertex-Connectivity of Graphs |
Sub Title (in English) |
|
Keyword(1) |
Graph |
Keyword(2) |
Property Testing |
Keyword(3) |
Vertex Connectivity |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yuichi Yoshida |
1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
2nd Author's Name |
Hiro Ito |
2nd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2008-06-16 16:10:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2008-22 |
Volume (vol) |
vol.108 |
Number (no) |
no.89 |
Page |
pp.49-55 |
#Pages |
7 |
Date of Issue |
2008-06-09 (COMP) |