Skip to main content

Advertisement

SpringerLink
Log in

Testing Convexity Properties of Tree Colorings

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests for convexity have applications in various areas involving large graphs. We study the important subcase of testing for convexity in trees. This problem is linked, among other possible applications, with the study of phylogenetic trees, which are central in genetic research, and are used in linguistics and other areas. We give a 1-sided, non-adaptive, distribution-free ε-test for the convexity of tree colorings. The query complexity of our test is O(k/ε), where k is the number of colors, and the additional computational complexity is O(n). On the other hand, we prove a lower bound of \(\Omega(\sqrt{k/\epsilon})\) on the query complexity of tests for convexity in the standard model, which applies even for (unweighted) paths. We also consider whether the dependency on k can be reduced in some cases, and provide an alternative testing algorithm for the case of paths. Then we investigate a variant of convexity, namely quasi-convexity, in which all but one of the colors are required to induce connected components. For this problem we provide a 1-sided, non-adaptive ε-test with query complexity O(k/ε 2) and time complexity O(kn/ε). For both our convexity and quasi-convexity tests, we show that, assuming that a query takes constant time, the time complexity can be reduced to a constant independent of n if we allow a preprocessing stage of time O(n) and O(n 2), respectively. Finally, we show how to test for a variation of convexity and quasi-convexity where the maximum number of connectivity classes of each color is allowed to be a constant value other than 1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput. 30(6), 1842–1862 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 549–595 (1993) (a preliminary version appeared in: Proceedings of the 22nd STOC, 1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chakraborty, S., Fischer, E., Lachish, O., Matsliah, A., Newman, I.: Testing st-connectivity. In: Proceedings of the 11th RANDOM and the 10th APPROX, pp. 380–394 (2007)

  4. Fischer, E.: The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97–126 (2001). Section 8

    MATH  Google Scholar 

  5. Fischer, E.: The art of uninformed decisions: a primer to property testing. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. I , pp. 229–264. World Scientific, Singapore (2004)

    Chapter  Google Scholar 

  6. Fischer, E., Lachish, O., Matsliah, A., Newman, I., Yahalom, O.: On the query complexity of testing orientations for being Eulerian. In: Proceedings of the 11th APPROX and 12th RANDOM. LNCS, vol. 5171, pp. 402–415. Springer, Berlin (2008)

    Google Scholar 

  7. Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: Proceedings of the 34th STOC, pp. 474–483 (2002)

  8. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653–750 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32, 302–343 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Halevy, S., Kushilevitz, E.: Distribution-free connectivity testing. In: Proceedings of the 8th RANDOM and the 7th APPROX, pp. 393–404 (2004)

  11. Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: Proceedings of the 7th RANDOM and the 6th APPROX, pp. 302–317 (2003)

  12. Halevy, S., Lachish, O., Newman, I., Tsur, D.: Testing orientation properties. Technical report, Electronic Colloquium on Computational Complexity (ECCC), Report No. 153 (2005)

  13. Halevy, S., Lachish, O., Newman, I., Tsur, D.: Testing properties of constraint-graphs. In: Proceedings of the 22nd IEEE Annual Conference on Computational Complexity (CCC), pp. 264–277 (2007)

  14. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. SIAM J. Comput. 13(2), 338–355 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Knuth, D.E.: The Art of Computer Programming, vol. 1: Fundamental Algorithms. Addison-Wesley, Reading (1968). Second edition, 1973

    MATH  Google Scholar 

  16. Moran, S., Snir, S.: Convex recolorings of phylogenetic trees: definitions, hardness results and algorithms. In: Workshop on Algorithms and Data Structures (WADS), pp. 218–232 (2005)

  17. Moret, B.M.E., Warnow, T.: Reconstructing optimal phylogenetic trees: a challenge in experimental algorithmics. In: Experimental Algorithmics. Lecture Notes in Computer Science, vol. 2547, pp. 163–180. Springer, Berlin (2002)

    Chapter  Google Scholar 

  18. Nakhleh, L., Warnow, T., Ringe, D., Evans, S.N.: A comparison of phylogenetic reconstruction methods on an IE dataset. Trans. Philol. Soc. 3(2), 171–192 (2005)

    Article  Google Scholar 

  19. Newman, I.: Testing of function that have small width branching programs. SIAM J. Comput. 31(5), 1557–1570 (2002) (a preliminary version appeared in: Proceedings of the 41st FOCS, 2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Parnas, M., Ron, D.: Testing the diameter of graphs. Random Struct. Algorithms 20(2), 165–183 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, vol. II, pp. 597–649. Kluwer Academic, Norwell (2001)

    Google Scholar 

  22. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252–271 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  23. Semple, C., Steel, M.: Phylogenetics. Oxford University Press, London (2003)

    MATH  Google Scholar 

  24. Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplifications and parallelization. SIAM J. Comput. 17, 1253–1262 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  25. Yao, A.C.: Probabilistic computation, towards a unified measure of complexity. In: Proceedings of the 18th IEEE FOCS, pp. 222–227 (1977)

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion – IIT, Haifa, 32000, Israel

    Eldar Fischer

  2. Department of Software Engineering, ORT Braude College, P.O. Box 78, Karmiel, 21982, Israel

    Orly Yahalom

Authors
  1. Eldar Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orly Yahalom
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Orly Yahalom.

Additional information

A preliminary version appeared in the proceedings of the 24th STACS (2007).

Research supported in part by an ERC-2007-StG grant number 202405-2 and by an ISF grant number 1101/06.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischer, E., Yahalom, O. Testing Convexity Properties of Tree Colorings. Algorithmica 60, 766–805 (2011). https://doi.org/10.1007/s00453-009-9368-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9368-2

Keywords

Search

Navigation