IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i1d10.1007_s10878-022-00927-1.html
   My bibliography  Save this article

Computing densest k-subgraph with structural parameters

Author

Listed:
  • Tesshu Hanaka

    (Kyushu University)

Abstract

Densest k-Subgraph is the problem to find a vertex subset S of size k such that the number of edges in the subgraph induced by S is maximized. In this paper, we show that Densest k-Subgraph is fixed parameter tractable when parameterized by neighborhood diversity, block deletion number, distance-hereditary deletion number, and cograph deletion number, respectively. Furthermore, we give a 2-approximation $$2^{{{\texttt{tc}}(G)}/2}n^{O(1)}$$ 2 tc ( G ) / 2 n O ( 1 ) -time algorithm where $${{\texttt{tc}}(G)}$$ tc ( G ) is the twin cover number of an input graph G.

Suggested Citation

  • Tesshu Hanaka, 2023. "Computing densest k-subgraph with structural parameters," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-17, January.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00927-1
    DOI: 10.1007/s10878-022-00927-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00927-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00927-1?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. Bourgeois, Nicolas & Giannakos, Aristotelis & Lucarelli, Giorgio & Milis, Ioannis & Paschos, Vangelis Th., 2017. "Exact and superpolynomial approximation algorithms for the densest k-subgraph problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 894-903.
    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. Zhongling Liu & Wenbin Chen & Fufang Li & Ke Qi & Jianxiong Wang, 2024. "Algorithms for Densest Subgraphs of Vertex-Weighted Graphs," Mathematics, MDPI, vol. 12(14), pages 1-10, July.

    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. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.

    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:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00927-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.