Abstract
We present an efficient algorithm for testing outerplanarity of graphs in the bounded-degree model. In this model, given a graph \(G\) with degree bound \(d\), we should distinguish with high probability the case that \(G\) is outerplanar from the case that modifying at least an \(\epsilon \)-fraction of the edge set is necessary to make \(G\) outerplanar. Our algorithm runs in time polynomial in \(d\) and \(\frac{1}{\epsilon }\) only. To achieve the time complexity, we exploit the tree-like structure inherent to an outerplanar graph using the microtree/macrotree decomposition of a tree. As a corollary, we show that the property of being a cactus is testable in time polynomial in \(d\) and \(\frac{1}{\epsilon }\).
Similar content being viewed by others
Notes
We assume that \(n\) and \(d\) are known in advance.
The original definition is described in terms of the number of vertices with degree at least \(3\) instead of the number of leaves. But it is essentially equivalent to our definition.
References
Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252–271 (1996)
Goldreich, O. (ed.): Property Testing: Current Research and Surveys. Volume 6390 of LNCS. Springer, Heidelberg (2010)
Rubinfeld, R., Shapira, A.: SIAM J. Discrete Math. 25(4), 1562–1588 (2012)
Fischer, E.: The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97–126 (2001)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2008)
Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. Adv. Math. 223(6), 2200–2218 (2010)
Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: Proceedings of 50th Annual IEEE Symposium on Foundations of Computer, Science (FOCS) (2009) 22–31
Levi, R., Ron, D.: A quasi-polynomial time partition oracle for graphs with an excluded minor. In: Proceedings of 40th International Colloquium Conference on Automata, Languages, and Programming (ICALP) (2013) 709–720
Edelman, A., Hassidim, A., Nguyen, H., Onak, K.: An efficient partitioning oracle for bounded-treewidth graphs. In: Proceedings of 15th International Workshop on Randomization and Computation (RANDOM) (2011) 530–541
Yoshida, Y., Ito, H.: Property testing on \(k\)-vertex connectivity of graphs. Algorithmica 62(3), 701–712 (2012)
Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. Combinatorica 19(3), 335–373 (1999)
Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. In: Proceedings of 48th Annual IEEE Symposium on Foundations of Computer, Science (FOCS) (2007) 570–578
Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229–232 (1979)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653–750 (1998)
Parnas, M., Ron, D.: Testing the diameter of graphs. Random Struct. Algorithms 20(2), 165–183 (2002)
Alon, N., Seymour, P., Thomas, R.: A separator theorem for nonplanar graphs. J. Am. Math. Soc. 3(4), 801–808 (1990)
Kleinberg, J., Rubinfeld, R.: Short paths in expander graphs. In: Proceedings of 37th Annual IEEE Symposium on Foundations of Computer, Science (FOCS) (1996) 86–95
Plotkin, S., Rao, S., Smith, W.D.: Shallow excluded minors and improved graph decompositions. In: Proceedings of 5th Annual ACM-SIAM symposium on Discrete algorithms (SODA) (1994) 462–470
Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proceedings of 39th Annual IEEE Symposium on Foundations of Computer, Science (FOCS) (1998) 534–543
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)
Lovász, L.: Graph minor theory. Bull. Am. Math. Soc. 43(1), 75–86 (2006)
Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SIAM J. Comput. 34(6), 1370–1379 (2005)
Burkard, R.E., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60(3), 193–215 (1998)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13–30 (1963)
El-Mallah, E., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circuits Syst. 35(3), 354–362 (1988)
Acknowledgments
Hiro Ito is supported by JSPS Grants-in-Aid for Challenging Exploratory Research (No. 24650006) and MEXT Grant-in-Aid for Scientific Research on Innovative Areas (No. 24106003). Yuichi Yoshida is supported by JSPS Grant-in-Aid for Young Scientists (B) (No. 26730009), MEXT Grant-in-Aid for Scientific Research on Innovative Areas (No. 24106003), and JST, ERATO, Kawarabayashi Large Graph Project.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proceedings of the 14th International Workshop on Randomization and Computation (RANDOM’10) pp. 642–655.
Rights and permissions
About this article
Cite this article
Yoshida, Y., Ito, H. Testing Outerplanarity of Bounded Degree Graphs. Algorithmica 73, 1–20 (2015). https://doi.org/10.1007/s00453-014-9897-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-014-9897-1