Skip to main content
SpringerLink
Log in

On Star-Cover and Path-Cover of a Tree

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

Abstract

We study two restricted versions of the Subforest Isomorphism problem, the Star-Cover of a Tree (SCT) and the Path-Cover of a Tree (PCT) problems. Both problems are NP-complete. The problems are closely related to a number of well-studied problems, including the problems Subgraph Isomorphism, Tree Editing, and Graph Packing. We show that the problems SCT and PCT are fixed-parameter tractable. Thorough development of parameterized algorithms and kernelization algorithms for these problems are presented.

This work is supported by the National Natural Science Foundation of China under Grants (61103033, 61173051, 61232001).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J. Comput. 26(6), 1656–1669 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anderson, S.: Graphical representation of molecules and substructure-search queries in MACCS. Journal of Molecular Graphics 2, 8–90 (1984)

    Article  Google Scholar 

  3. Baumbach, J., Guo, J., Ibragimov, R.: Covering Tree with Stars. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 373–384. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Bille, P.: A survey on tree edit distance and reltaed problems. Theoret. Comput. Sci. 337, 217–239 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41(2), 280–301 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, X., Liu, L., Liu, Z.: On the minimum common integer partition problem. ACM Trans. Algorithm 5(12), 1–18 (2008)

    Google Scholar 

  7. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition 18(3), 265–298 (2004)

    Article  Google Scholar 

  8. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. McGraw-Hill, Boston (2001)

    MATH  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  10. Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: Proc. 6th Annual ACM Symp. Theory of Computing (STOC 1974), pp. 172–184 (1974)

    Google Scholar 

  11. Kirkpatrick, B., Reshef, Y., Finucane, H., Jiang, H., Zhu, B., Karp, R.: Comparing pedigree graphs. Journal of Computational Biology 19(9), 998–1014 (2012)

    Article  MathSciNet  Google Scholar 

  12. Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proc. 11th Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2000), pp. 696–704 (2000)

    Google Scholar 

  13. Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. IEEE Trans. Pattern Analysis and Machine Intelligence 21(11), 1105–1119 (1999)

    Article  Google Scholar 

  14. Shi, F., Wang, J., Chen, J., Feng, Q., Guo, J.: Algorithms for parameterized maximum agreement forest problem on multiple trees. Theoret. Comput. Sci. (in press)

    Google Scholar 

  15. Stobaugh, R.E.: Chemical substructure searching. Journal of Chemical Information and Computer Sciences 25, 271–275 (1985)

    Google Scholar 

  16. Yang, H., Lee, L., Hsu, W.: Finding hot query patterns over an XQuery stream. The International Journal of Very large Data Bases 13(4), 318–332 (2004)

    Article  Google Scholar 

  17. Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review 1(1), 12–26 (2007)

    Article  Google Scholar 

  18. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 1245–1262 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, China

    Jie You, Qilong Feng & Feng Shi

  2. Universität des Saarlandes, Campus E 1.7, Saarbrücken, 66123, Germany

    Jiong Guo

Authors
  1. Jie You
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Feng Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

You, J., Feng, Q., Guo, J., Shi, F. (2014). On Star-Cover and Path-Cover of a Tree. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation