IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v332y2018icp42-47.html
   My bibliography  Save this article

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth

Author

Listed:
  • Wan, Pengfei
  • Tu, Jianhua
  • Zhang, Shenggui
  • Li, Binlong

Abstract

In the theory and applications of graphs, it is a basic problem to compute the numbers of independent sets and matchings of given sizes. Since the problem of computing the total number of independent sets and that of matchings of graphs is #P-complete, it is unlikely to give efficient algorithms to find the numbers of independent sets and matchings of given sizes. In this paper, for graphs with order n and treewidth at most p, we present two dynamic algorithms to compute the numbers of independent sets of all sizes with runtime O(2p · pn3) and the numbers of matchings of all sizes with runtime O(22p · pn3), respectively. By the algorithms presented in this paper, for graphs with small treewidths, the numbers of independent sets and matchings of all possible sizes can be computed efficiently.

Suggested Citation

  • Wan, Pengfei & Tu, Jianhua & Zhang, Shenggui & Li, Binlong, 2018. "Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 42-47.
    • Handle: RePEc:eee:apmaco:v:332:y:2018:i:c:p:42-47
    DOI: 10.1016/j.amc.2018.03.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301826
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.03.017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Herrera, Luis H. & Pérez-Lantero, Pablo, 2021. "On the intersection graph of the disks with diameters the sides of a convex n-gon," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    2. Wenwen Tian & Fei Zhao & Zheng Sun & Xuesong Mei & Guangde Chen, 2019. "Orderings of a class of trees with respect to the Merrifield–Simmons index and the Hosoya index," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1286-1295, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Guihai & Qu, Hui, 2018. "The coefficients of the immanantal polynomial," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 38-44.
    2. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    3. Ghorbani, Modjtaba & Dehmer, Matthias & Rajabi-Parsa, Mina & Emmert-Streib, Frank & Mowshowitz, Abbe, 2019. "Hosoya entropy of fullerene graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 88-98.
    4. Ma, Yuede & Cao, Shujuan & Shi, Yongtang & Dehmer, Matthias & Xia, Chengyi, 2019. "Nordhaus–Gaddum type results for graph irregularities," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 268-272.
    5. Lan, Yongxin & Li, Tao & Ma, Yuede & Shi, Yongtang & Wang, Hua, 2018. "Vertex-based and edge-based centroids of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 445-456.
    6. Wan, Pengfei & Tu, Jianhua & Dehmer, Matthias & Zhang, Shenggui & Emmert-Streib, Frank, 2019. "Graph entropy based on the number of spanning forests of c-cyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    7. Mikołaj Morzy & Tomasz Kajdanowicz & Przemysław Kazienko, 2017. "On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy," Complexity, Hindawi, vol. 2017, pages 1-12, November.
    8. Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.
    9. Lan, Yongxin & Li, Tao & Wang, Hua & Xia, Chengyi, 2019. "A note on extremal trees with degree conditions," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 70-79.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:332:y:2018:i:c:p:42-47. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.