Abstract
Suppose there is an undirected tree T containing n nodes and having bounded degree d. We know the nodes in T but not the edges. The problem is to output the tree T by asking queries of the form: “Does the node y lie on the path between node x and node z?”. In other words, we can ask if removing node y disconnects node x from node z. Such a query is called a separator query. Assume that each query can be answered in constant time by an oracle. The objective is to minimize the time taken to output the tree in terms of n.
Our main result is an O(dn 1.5logn) time algorithm for the above problem. To the best of our knowledge, no o(n 2) algorithm is known even for constant-degree trees. We also give an O(d 2 nlog2 n) randomized algorithm and prove an Ω(dn) lower bound for the same problem. Time complexity equals query complexity for all our results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press (2009)
Federico, S.: A survey on independence-based Markov networks learning. Artificial Intelligence Review, 1–25 (2012)
Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 379–388. IEEE (2006)
Culberson, J.C., Rudnicki, P.: A fast algorithm for constructing trees from distance matrices. Information Processing Letters 30(4), 215–220 (1989)
Reyzin, L., Srivastava, N.: On the longest path algorithm for reconstructing trees from distance matrices. Information Processing Letters 101(3), 98–100 (2007)
Hein, J.J.: An optimal algorithm to reconstruct trees from additive distance data. Bulletin of Mathematical Biology 51(5), 597–603 (1989)
King, V., Zhang, L., Zhou, Y.: On the complexity of distance-based evolutionary tree reconstruction. In: Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 444–453 (2003)
Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14, 462–467 (1968)
Karger, D., Srebro, N.: Learning Markov networks: Maximum bounded tree-width graphs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 392–401. Society for Industrial and Applied Mathematics (2001)
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 177–189 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jagadish, M., Sen, A. (2013). Learning a Bounded-Degree Tree Using Separator Queries. In: Jain, S., Munos, R., Stephan, F., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2013. Lecture Notes in Computer Science(), vol 8139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40935-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-40935-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40934-9
Online ISBN: 978-3-642-40935-6
eBook Packages: Computer ScienceComputer Science (R0)