An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges. We extend previous work on Densestk-Subgraph by studying its parameterized complexity...
Saved in:
| Published in: | Discrete Applied Mathematics Vol. 193; pp. 145 - 161 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.10.2015
|
| Subjects: | |
| ISSN: | 0166-218X, 1872-6771 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges. We extend previous work on Densestk-Subgraph by studying its parameterized complexity for parameters describing the sparseness of the input graph and for parameters related to the solution size k.
On the positive side, we show that, when fixing some constant minimum density μ of the sought subgraph, Densestk-Subgraph becomes fixed-parameter tractable with respect to either of the parameters maximum degree of G and h-index of G. Furthermore, we obtain a fixed-parameter algorithm for Densestk-Subgraph with respect to the combined parameter “degeneracy of G and |V|−k”.
On the negative side, we find that Densestk-Subgraph is W[1]-hard with respect to the combined parameter “solution size k and degeneracy of G”. We furthermore strengthen a previous hardness result for Densestk-Subgraph (Cai, 2008) by showing that for every fixed μ, 0<μ<1, the problem of deciding whether G contains a subgraph of density at least μ is W[1]-hard with respect to the parameter |V|−k.
Our positive results are obtained by an algorithmic framework that can be applied to a wide range of Fixed-Cardinality Optimization problems. |
|---|---|
| AbstractList | We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges. We extend previous work on Densestk-Subgraph by studying its parameterized complexity for parameters describing the sparseness of the input graph and for parameters related to the solution size k.
On the positive side, we show that, when fixing some constant minimum density μ of the sought subgraph, Densestk-Subgraph becomes fixed-parameter tractable with respect to either of the parameters maximum degree of G and h-index of G. Furthermore, we obtain a fixed-parameter algorithm for Densestk-Subgraph with respect to the combined parameter “degeneracy of G and |V|−k”.
On the negative side, we find that Densestk-Subgraph is W[1]-hard with respect to the combined parameter “solution size k and degeneracy of G”. We furthermore strengthen a previous hardness result for Densestk-Subgraph (Cai, 2008) by showing that for every fixed μ, 0<μ<1, the problem of deciding whether G contains a subgraph of density at least μ is W[1]-hard with respect to the parameter |V|−k.
Our positive results are obtained by an algorithmic framework that can be applied to a wide range of Fixed-Cardinality Optimization problems. |
| Author | Komusiewicz, Christian Sorge, Manuel |
| Author_xml | – sequence: 1 givenname: Christian surname: Komusiewicz fullname: Komusiewicz, Christian email: christian.komusiewicz@tu-berlin.de – sequence: 2 givenname: Manuel surname: Sorge fullname: Sorge, Manuel email: manuel.sorge@tu-berlin.de |
| BookMark | eNp9kMlOwzAQQC0EEm3hA7j5BxLGWVtxQohNQuICEjdrYk9gShJHtlnK15MCJw49jWZ5o5k3F_uDG0iIEwWpAlWdrlOLfZqBKlMoUshWe2KmlnWWVHWt9sVsmqmSTC2fDsU8hDUAqCmbCXc-SOyenef40rORrceePpx_la3zsuVPsolBb3nAjuNGujFyz18Y2Q2SBxlG9IHks8fxJUgcx47JyuikpWGqh7fmpyVH75qO-nAkDlrsAh3_xYV4vLp8uLhJ7u6vby_O7xKT5xATMqXCtikRgVploMgbLHIFSFaZhpbUwKohi5CXbQEqr6qsXNWr3JRZWVNF-ULUv3uNdyF4arXh-HN19MidVqC33vRaT9701puGQk_eJlL9I0fPPfrNTubsl6HppXcmr4NhGgxZ9mSito530N9mCouA |
| CitedBy_id | crossref_primary_10_3390_a9010021 crossref_primary_10_1016_j_dam_2025_05_012 crossref_primary_10_1016_j_ipl_2021_106105 crossref_primary_10_1016_j_trc_2021_102997 crossref_primary_10_1145_3653298 crossref_primary_10_1007_s00453_022_01062_3 crossref_primary_10_1007_s00453_022_01090_z crossref_primary_10_1016_j_ejor_2017_04_034 crossref_primary_10_1016_j_tcs_2024_114625 crossref_primary_10_1016_j_tcs_2019_03_045 crossref_primary_10_1016_j_disopt_2018_05_002 crossref_primary_10_1137_21M1449476 crossref_primary_10_3390_a8040810 |
| Cites_doi | 10.1016/j.dam.2005.05.036 10.1007/978-3-319-20086-6_7 10.1145/2344422.2344428 10.1007/s00453-011-9609-z 10.1093/comjnl/bxm086 10.1007/s00453-007-9008-7 10.1137/120880240 10.1145/2543629 10.1007/s11590-011-0311-5 10.1287/opre.1100.0851 10.1137/0218003 10.1016/j.ipl.2010.11.005 10.1073/pnas.48.7.1142 10.1145/176454.176484 10.1007/s10878-005-1857-x 10.1006/jcss.2001.1774 10.1007/s004530010050 10.7155/jgaa.00273 10.1016/j.ic.2005.05.001 10.1016/j.dam.2012.07.019 10.1007/s00453-011-9487-4 10.1007/s00453-014-9920-6 10.1007/BF03024089 10.1016/j.ipl.2014.04.009 10.1016/0304-3975(94)00097-3 10.1016/j.dam.2006.01.005 10.1145/210332.210337 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.dam.2015.04.029 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1872-6771 |
| EndPage | 161 |
| ExternalDocumentID | 10_1016_j_dam_2015_04_029 S0166218X1500222X |
| GroupedDBID | -~X 6I. AAFTH ADEZE AFTJW ALMA_UNASSIGNED_HOLDINGS FDB OAUVE AAYXX AI. CITATION FA8 VH1 WUQ |
| ID | FETCH-LOGICAL-c330t-ec51afb5aa0ef1c043ba4310aed1cbe8eb09beda035f401366259793c5257e6e3 |
| ISICitedReferencesCount | 29 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000359174700014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0166-218X |
| IngestDate | Tue Nov 18 21:47:05 EST 2025 Sat Nov 29 02:59:34 EST 2025 Sat Apr 29 22:45:09 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Fixed-parameter algorithms NP-hard problems Clique relaxations Subgraph enumeration |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-ec51afb5aa0ef1c043ba4310aed1cbe8eb09beda035f401366259793c5257e6e3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.dam.2015.04.029 |
| PageCount | 17 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_dam_2015_04_029 crossref_primary_10_1016_j_dam_2015_04_029 elsevier_sciencedirect_doi_10_1016_j_dam_2015_04_029 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-10-01 |
| PublicationDateYYYYMMDD | 2015-10-01 |
| PublicationDate_xml | – month: 10 year: 2015 text: 2015-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete Applied Mathematics |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Cai (br000065) 2008; 51 Hermelin, Huang, Kratsch, Wahlström (br000140) 2013; 65 Balasundaram, Butenko, Trukhanov (br000020) 2005; 10 Chang, Chen, Hung, Rossmanith, Wu (br000075) 2014; 114 Flum, Grohe (br000120) 2006 P. Deshpande, R. Barzilay, D.R. Karger, Randomized decoding for selection-and-ordering problems, in: Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, HLT-NAACL’07, 2007, pp. 444–451. Feige, Peleg, Kortsarz (br000110) 2001; 29 Cai, Chan, Chan (br000070) 2006; vol. 4169 Chen, Chor, Fellows, Huang, Juedes, Kanj, Xia (br000080) 2005; 201 Shachnai, Zehavi (br000225) 2014; vol. 8747 Bonnet, Escoffier, Paschos, Tourniaire (br000045) 2015; 71 Alon, Yuster, Zwick (br000005) 1995; 42 Kosub (br000190) 2004; vol. 3418 Pattillo, Veremyev, Butenko, Boginski (br000205) 2013; 161 Downey, Fellows (br000090) 1995; 141 Briggs, Torczon (br000055) 1993; 2 Binkele-Raible, Fernau, Fomin, Lokshtanov, Saurabh, Villanger (br000030) 2012; 8 Schäfer, Komusiewicz, Moser, Niedermeier (br000220) 2012; 6 Amini, Sau, Saurabh (br000010) 2008; vol. 5018 Guo, Kanj, Komusiewicz, Uhlmann (br000130) 2011; 61 Niedermeier (br000200) 2006; vol. 31 C. Komusiewicz, M. Sorge, K. Stahl, Finding connected subgraphs of fixed minimum density: Implementation and experiments, in: Proceedings of the 14th International Symposium on Experimental Algorithms, SEA’15, 2015 in press. Harary (br000135) 1962; 48 Downey, Fellows (br000095) 2012 Hüffner, Wernicke, Zichner (br000145) 2008; 52 Impagliazzo, Paturi, Zane (br000160) 2001; 63 Khot (br000170) 2004 Robbins (br000210) 1955 Bourgeois, Giannakos, Lucarelli, Milis, Paschos (br000050) 2013; vol. 7748 Bruglieri, Ehrgott, Hamacher, Maffioli (br000060) 2006; 154 Khuller, Saha (br000175) 2009; vol. 5555 Eppstein, Löffler, Strash (br000100) 2013; 18 Balasundaram, Butenko, Hicks (br000015) 2011; 59 Bollobás (br000040) 2006 Feige, Seltser (br000115) 1997 Gallo, Grigoriadis, Tarjan (br000125) 1989; 18 Saha, Hoch, Khuller, Raschid, Zhang (br000215) 2010; vol. 6044 Komusiewicz, Sorge (br000180) 2012; vol. 7535 Holzapfel, Kosub, Maaß, Täubig (br000155) 2006; 154 Balasundaram, Pajouh (br000025) 2013 Bodlaender, Jansen, Kratsch (br000035) 2014; 28 Lokshtanov, Marx, Saurabh (br000195) 2011; 105 Katrenic, Schiermeyer (br000165) 2011; 111 Hilton, Pedersen (br000150) 1991; 13 Eppstein, Spiro (br000105) 2012; 16 Niedermeier (10.1016/j.dam.2015.04.029_br000200) 2006; vol. 31 Chen (10.1016/j.dam.2015.04.029_br000080) 2005; 201 Katrenic (10.1016/j.dam.2015.04.029_br000165) 2011; 111 Briggs (10.1016/j.dam.2015.04.029_br000055) 1993; 2 Shachnai (10.1016/j.dam.2015.04.029_br000225) 2014; vol. 8747 Saha (10.1016/j.dam.2015.04.029_br000215) 2010; vol. 6044 Balasundaram (10.1016/j.dam.2015.04.029_br000020) 2005; 10 Bodlaender (10.1016/j.dam.2015.04.029_br000035) 2014; 28 Balasundaram (10.1016/j.dam.2015.04.029_br000015) 2011; 59 Komusiewicz (10.1016/j.dam.2015.04.029_br000180) 2012; vol. 7535 Downey (10.1016/j.dam.2015.04.029_br000095) 2012 Eppstein (10.1016/j.dam.2015.04.029_br000100) 2013; 18 Gallo (10.1016/j.dam.2015.04.029_br000125) 1989; 18 Schäfer (10.1016/j.dam.2015.04.029_br000220) 2012; 6 Bruglieri (10.1016/j.dam.2015.04.029_br000060) 2006; 154 Bourgeois (10.1016/j.dam.2015.04.029_br000050) 2013; vol. 7748 Feige (10.1016/j.dam.2015.04.029_br000115) 1997 Cai (10.1016/j.dam.2015.04.029_br000070) 2006; vol. 4169 Balasundaram (10.1016/j.dam.2015.04.029_br000025) 2013 Guo (10.1016/j.dam.2015.04.029_br000130) 2011; 61 10.1016/j.dam.2015.04.029_br000085 Downey (10.1016/j.dam.2015.04.029_br000090) 1995; 141 Impagliazzo (10.1016/j.dam.2015.04.029_br000160) 2001; 63 Chang (10.1016/j.dam.2015.04.029_br000075) 2014; 114 10.1016/j.dam.2015.04.029_br000185 Flum (10.1016/j.dam.2015.04.029_br000120) 2006 Binkele-Raible (10.1016/j.dam.2015.04.029_br000030) 2012; 8 Hüffner (10.1016/j.dam.2015.04.029_br000145) 2008; 52 Khuller (10.1016/j.dam.2015.04.029_br000175) 2009; vol. 5555 Robbins (10.1016/j.dam.2015.04.029_br000210) 1955 Lokshtanov (10.1016/j.dam.2015.04.029_br000195) 2011; 105 Alon (10.1016/j.dam.2015.04.029_br000005) 1995; 42 Cai (10.1016/j.dam.2015.04.029_br000065) 2008; 51 Hilton (10.1016/j.dam.2015.04.029_br000150) 1991; 13 Kosub (10.1016/j.dam.2015.04.029_br000190) 2004; vol. 3418 Hermelin (10.1016/j.dam.2015.04.029_br000140) 2013; 65 Holzapfel (10.1016/j.dam.2015.04.029_br000155) 2006; 154 Pattillo (10.1016/j.dam.2015.04.029_br000205) 2013; 161 Harary (10.1016/j.dam.2015.04.029_br000135) 1962; 48 Bollobás (10.1016/j.dam.2015.04.029_br000040) 2006 Eppstein (10.1016/j.dam.2015.04.029_br000105) 2012; 16 Khot (10.1016/j.dam.2015.04.029_br000170) 2004 Amini (10.1016/j.dam.2015.04.029_br000010) 2008; vol. 5018 Feige (10.1016/j.dam.2015.04.029_br000110) 2001; 29 Bonnet (10.1016/j.dam.2015.04.029_br000045) 2015; 71 |
| References_xml | – start-page: 1559 year: 2013 end-page: 1598 ident: br000025 article-title: Graph theoretic clique relaxations and applications publication-title: Handbook of Combinatorial Optimization – volume: 13 start-page: 64 year: 1991 end-page: 75 ident: br000150 article-title: Catalan numbers, their generalization, and their uses publication-title: Math. Intelligencer – volume: 59 start-page: 133 year: 2011 end-page: 142 ident: br000015 article-title: Clique relaxations in social network analysis: The maximum publication-title: Oper. Res. – reference: P. Deshpande, R. Barzilay, D.R. Karger, Randomized decoding for selection-and-ordering problems, in: Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, HLT-NAACL’07, 2007, pp. 444–451. – start-page: 136 year: 2004 end-page: 145 ident: br000170 article-title: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique publication-title: Proceedings of the~45th Annual IEEE Symposium on Foundations of Computer Science – reference: C. Komusiewicz, M. Sorge, K. Stahl, Finding connected subgraphs of fixed minimum density: Implementation and experiments, in: Proceedings of the 14th International Symposium on Experimental Algorithms, SEA’15, 2015 in press. – volume: 105 start-page: 41 year: 2011 end-page: 72 ident: br000195 article-title: Lower bounds based on the exponential time hypothesis publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. EATCS – volume: 61 start-page: 949 year: 2011 end-page: 970 ident: br000130 article-title: Editing graphs into disjoint unions of dense clusters publication-title: Algorithmica – volume: 16 start-page: 543 year: 2012 end-page: 567 ident: br000105 article-title: The h-index of a graph and its application to dynamic subgraph statistics publication-title: J. Graph Algorithms Appl. – volume: 6 start-page: 883 year: 2012 end-page: 891 ident: br000220 article-title: Parameterized computational complexity of finding small-diameter subgraphs publication-title: Optim. Lett. – volume: 8 start-page: 38 year: 2012 ident: br000030 article-title: Kernel(s) for problems with no kernel: On out-trees with many leaves publication-title: ACM Trans. Algorithms – year: 2006 ident: br000120 article-title: Parameterized Complexity Theory – volume: vol. 3418 start-page: 112 year: 2004 end-page: 142 ident: br000190 article-title: Local density publication-title: Network Analysis – volume: vol. 7748 start-page: 114 year: 2013 end-page: 125 ident: br000050 article-title: Exact and approximation algorithms for densest publication-title: Proceedings of the 7th International Workshop on Algorithms and Computation – volume: 2 start-page: 59 year: 1993 end-page: 69 ident: br000055 article-title: An efficient representation for sparse sets publication-title: ACM Lett. Program. Lang. Syst. – volume: vol. 5018 start-page: 13 year: 2008 end-page: 29 ident: br000010 article-title: Parameterized complexity of the smallest degree-constrained subgraph problem publication-title: Proceedings of the~3rd International Workshop on Parameterized and Exact Computation – volume: vol. 4169 start-page: 239 year: 2006 end-page: 250 ident: br000070 article-title: Random separation: A new method for solving fixed-cardinality optimization problems publication-title: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation – volume: 18 start-page: 30 year: 1989 end-page: 55 ident: br000125 article-title: A fast parametric maximum flow algorithm and applications publication-title: SIAM J. Comput. – volume: 111 start-page: 110 year: 2011 end-page: 114 ident: br000165 article-title: Improved approximation bounds for the minimum rainbow subgraph problem publication-title: Inform. Process. Lett. – volume: 29 start-page: 410 year: 2001 end-page: 421 ident: br000110 article-title: The dense publication-title: Algorithmica – volume: 52 start-page: 114 year: 2008 end-page: 132 ident: br000145 article-title: Algorithm engineering for color-coding with applications to signaling pathway detection publication-title: Algorithmica – volume: 63 start-page: 512 year: 2001 end-page: 530 ident: br000160 article-title: Which problems have strongly exponential complexity? publication-title: J. Comput. System Sci. – volume: vol. 6044 start-page: 456 year: 2010 end-page: 472 ident: br000215 article-title: Dense subgraphs with restrictions and applications to gene annotation graphs publication-title: Proceedings of the~14th Annual International Conference on Research in Computational Molecular Biology – volume: 28 start-page: 277 year: 2014 end-page: 305 ident: br000035 article-title: Kernelization lower bounds by cross-composition publication-title: SIAM J. Discrete Math. – volume: vol. 5555 start-page: 597 year: 2009 end-page: 608 ident: br000175 article-title: On finding dense subgraphs publication-title: Proceedings of~36th~International Colloquium on Automata, Languages and Programming – volume: 51 start-page: 102 year: 2008 end-page: 121 ident: br000065 article-title: Parameterized complexity of cardinality constrained optimization problems publication-title: Comput. J. – volume: vol. 7535 start-page: 242 year: 2012 end-page: 251 ident: br000180 article-title: Finding dense subgraphs of sparse graphs publication-title: Proceedings of the 7th International Symposium on Parameterized and Exact Computation – volume: 71 start-page: 566 year: 2015 end-page: 580 ident: br000045 article-title: Multi-parameter analysis for local graph partitioning problems: Using greediness for parameterization publication-title: Algorithmica – volume: 65 start-page: 802 year: 2013 end-page: 816 ident: br000140 article-title: Parameterized two-player nash equilibrium publication-title: Algorithmica – volume: 18 year: 2013 ident: br000100 article-title: Listing all maximal cliques in large sparse real-world graphs publication-title: ACM J. Exp. Algorithmics – volume: 48 start-page: 1142 year: 1962 end-page: 1146 ident: br000135 article-title: The maximum connectivity of a graph publication-title: Proc. Natl. Acad. Sci. USA – volume: 154 start-page: 1344 year: 2006 end-page: 1357 ident: br000060 article-title: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints publication-title: Discrete Appl. Math. – volume: 141 start-page: 109 year: 1995 end-page: 131 ident: br000090 article-title: Fixed-parameter tractability and completeness II: On completeness for W[1] publication-title: Theoret. Comput. Sci. – start-page: 26 year: 1955 end-page: 29 ident: br000210 article-title: A remark on Stirling’s formula publication-title: Amer. Math. Monthly – volume: 201 start-page: 216 year: 2005 end-page: 231 ident: br000080 article-title: Tight lower bounds for certain parameterized NP-hard problems publication-title: Inform. and Comput. – year: 1997 ident: br000115 article-title: On the Densest – volume: 161 start-page: 244 year: 2013 end-page: 257 ident: br000205 article-title: On the maximum quasi-clique problem publication-title: Discrete Appl. Math. – volume: 10 start-page: 23 year: 2005 end-page: 39 ident: br000020 article-title: Novel approaches for analyzing biological networks publication-title: J. Comb. Optim. – volume: vol. 8747 start-page: 384 year: 2014 end-page: 395 ident: br000225 article-title: Parameterized algorithms for graph partitioning problems publication-title: Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science – volume: vol. 31 year: 2006 ident: br000200 publication-title: Invitation to Fixed-Parameter Algorithms – volume: 114 start-page: 510 year: 2014 end-page: 513 ident: br000075 article-title: Exact algorithms for problems related to the densest publication-title: Inform. Process. Lett. – volume: 154 start-page: 1547 year: 2006 end-page: 1562 ident: br000155 article-title: The complexity of detecting fixed-density clusters publication-title: Discrete Appl. Math. – year: 2012 ident: br000095 article-title: Fundamentals of Parameterized Complexity – volume: 42 start-page: 844 year: 1995 end-page: 856 ident: br000005 article-title: Color-coding publication-title: J. ACM – year: 2006 ident: br000040 article-title: The Art of Mathematics – volume: 154 start-page: 1344 issue: 9 year: 2006 ident: 10.1016/j.dam.2015.04.029_br000060 article-title: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2005.05.036 – ident: 10.1016/j.dam.2015.04.029_br000185 doi: 10.1007/978-3-319-20086-6_7 – year: 1997 ident: 10.1016/j.dam.2015.04.029_br000115 – volume: 8 start-page: 38 issue: 4 year: 2012 ident: 10.1016/j.dam.2015.04.029_br000030 article-title: Kernel(s) for problems with no kernel: On out-trees with many leaves publication-title: ACM Trans. Algorithms doi: 10.1145/2344422.2344428 – volume: vol. 7535 start-page: 242 year: 2012 ident: 10.1016/j.dam.2015.04.029_br000180 article-title: Finding dense subgraphs of sparse graphs – year: 2006 ident: 10.1016/j.dam.2015.04.029_br000040 – volume: vol. 5555 start-page: 597 year: 2009 ident: 10.1016/j.dam.2015.04.029_br000175 article-title: On finding dense subgraphs – volume: 65 start-page: 802 issue: 4 year: 2013 ident: 10.1016/j.dam.2015.04.029_br000140 article-title: Parameterized two-player nash equilibrium publication-title: Algorithmica doi: 10.1007/s00453-011-9609-z – year: 2012 ident: 10.1016/j.dam.2015.04.029_br000095 – volume: 51 start-page: 102 issue: 1 year: 2008 ident: 10.1016/j.dam.2015.04.029_br000065 article-title: Parameterized complexity of cardinality constrained optimization problems publication-title: Comput. J. doi: 10.1093/comjnl/bxm086 – volume: 52 start-page: 114 issue: 2 year: 2008 ident: 10.1016/j.dam.2015.04.029_br000145 article-title: Algorithm engineering for color-coding with applications to signaling pathway detection publication-title: Algorithmica doi: 10.1007/s00453-007-9008-7 – volume: 28 start-page: 277 issue: 1 year: 2014 ident: 10.1016/j.dam.2015.04.029_br000035 article-title: Kernelization lower bounds by cross-composition publication-title: SIAM J. Discrete Math. doi: 10.1137/120880240 – volume: 105 start-page: 41 year: 2011 ident: 10.1016/j.dam.2015.04.029_br000195 article-title: Lower bounds based on the exponential time hypothesis publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. EATCS – start-page: 1559 year: 2013 ident: 10.1016/j.dam.2015.04.029_br000025 article-title: Graph theoretic clique relaxations and applications – volume: 18 year: 2013 ident: 10.1016/j.dam.2015.04.029_br000100 article-title: Listing all maximal cliques in large sparse real-world graphs publication-title: ACM J. Exp. Algorithmics doi: 10.1145/2543629 – volume: 6 start-page: 883 issue: 5 year: 2012 ident: 10.1016/j.dam.2015.04.029_br000220 article-title: Parameterized computational complexity of finding small-diameter subgraphs publication-title: Optim. Lett. doi: 10.1007/s11590-011-0311-5 – volume: 59 start-page: 133 issue: 1 year: 2011 ident: 10.1016/j.dam.2015.04.029_br000015 article-title: Clique relaxations in social network analysis: The maximum k-plex problem publication-title: Oper. Res. doi: 10.1287/opre.1100.0851 – volume: vol. 5018 start-page: 13 year: 2008 ident: 10.1016/j.dam.2015.04.029_br000010 article-title: Parameterized complexity of the smallest degree-constrained subgraph problem – volume: 18 start-page: 30 issue: 1 year: 1989 ident: 10.1016/j.dam.2015.04.029_br000125 article-title: A fast parametric maximum flow algorithm and applications publication-title: SIAM J. Comput. doi: 10.1137/0218003 – volume: 111 start-page: 110 issue: 3 year: 2011 ident: 10.1016/j.dam.2015.04.029_br000165 article-title: Improved approximation bounds for the minimum rainbow subgraph problem publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2010.11.005 – volume: 48 start-page: 1142 issue: 7 year: 1962 ident: 10.1016/j.dam.2015.04.029_br000135 article-title: The maximum connectivity of a graph publication-title: Proc. Natl. Acad. Sci. USA doi: 10.1073/pnas.48.7.1142 – volume: 2 start-page: 59 issue: 1–4 year: 1993 ident: 10.1016/j.dam.2015.04.029_br000055 article-title: An efficient representation for sparse sets publication-title: ACM Lett. Program. Lang. Syst. doi: 10.1145/176454.176484 – year: 2006 ident: 10.1016/j.dam.2015.04.029_br000120 – volume: 10 start-page: 23 issue: 1 year: 2005 ident: 10.1016/j.dam.2015.04.029_br000020 article-title: Novel approaches for analyzing biological networks publication-title: J. Comb. Optim. doi: 10.1007/s10878-005-1857-x – volume: 63 start-page: 512 issue: 4 year: 2001 ident: 10.1016/j.dam.2015.04.029_br000160 article-title: Which problems have strongly exponential complexity? publication-title: J. Comput. System Sci. doi: 10.1006/jcss.2001.1774 – volume: 29 start-page: 410 issue: 3 year: 2001 ident: 10.1016/j.dam.2015.04.029_br000110 article-title: The dense k-subgraph problem publication-title: Algorithmica doi: 10.1007/s004530010050 – volume: vol. 3418 start-page: 112 year: 2004 ident: 10.1016/j.dam.2015.04.029_br000190 article-title: Local density – volume: 16 start-page: 543 issue: 2 year: 2012 ident: 10.1016/j.dam.2015.04.029_br000105 article-title: The h-index of a graph and its application to dynamic subgraph statistics publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00273 – volume: vol. 7748 start-page: 114 year: 2013 ident: 10.1016/j.dam.2015.04.029_br000050 article-title: Exact and approximation algorithms for densest k-subgraph – volume: 201 start-page: 216 issue: 2 year: 2005 ident: 10.1016/j.dam.2015.04.029_br000080 article-title: Tight lower bounds for certain parameterized NP-hard problems publication-title: Inform. and Comput. doi: 10.1016/j.ic.2005.05.001 – volume: 161 start-page: 244 issue: 1–2 year: 2013 ident: 10.1016/j.dam.2015.04.029_br000205 article-title: On the maximum quasi-clique problem publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2012.07.019 – volume: vol. 4169 start-page: 239 year: 2006 ident: 10.1016/j.dam.2015.04.029_br000070 article-title: Random separation: A new method for solving fixed-cardinality optimization problems – start-page: 26 year: 1955 ident: 10.1016/j.dam.2015.04.029_br000210 article-title: A remark on Stirling’s formula publication-title: Amer. Math. Monthly – volume: 61 start-page: 949 issue: 4 year: 2011 ident: 10.1016/j.dam.2015.04.029_br000130 article-title: Editing graphs into disjoint unions of dense clusters publication-title: Algorithmica doi: 10.1007/s00453-011-9487-4 – volume: 71 start-page: 566 issue: 3 year: 2015 ident: 10.1016/j.dam.2015.04.029_br000045 article-title: Multi-parameter analysis for local graph partitioning problems: Using greediness for parameterization publication-title: Algorithmica doi: 10.1007/s00453-014-9920-6 – volume: 13 start-page: 64 issue: 2 year: 1991 ident: 10.1016/j.dam.2015.04.029_br000150 article-title: Catalan numbers, their generalization, and their uses publication-title: Math. Intelligencer doi: 10.1007/BF03024089 – start-page: 136 year: 2004 ident: 10.1016/j.dam.2015.04.029_br000170 article-title: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique – volume: 114 start-page: 510 issue: 9 year: 2014 ident: 10.1016/j.dam.2015.04.029_br000075 article-title: Exact algorithms for problems related to the densest k-set problem publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2014.04.009 – volume: vol. 31 year: 2006 ident: 10.1016/j.dam.2015.04.029_br000200 – volume: vol. 8747 start-page: 384 year: 2014 ident: 10.1016/j.dam.2015.04.029_br000225 article-title: Parameterized algorithms for graph partitioning problems – volume: 141 start-page: 109 issue: 1&2 year: 1995 ident: 10.1016/j.dam.2015.04.029_br000090 article-title: Fixed-parameter tractability and completeness II: On completeness for W[1] publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)00097-3 – volume: 154 start-page: 1547 issue: 11 year: 2006 ident: 10.1016/j.dam.2015.04.029_br000155 article-title: The complexity of detecting fixed-density clusters publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2006.01.005 – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 10.1016/j.dam.2015.04.029_br000005 article-title: Color-coding publication-title: J. ACM doi: 10.1145/210332.210337 – volume: vol. 6044 start-page: 456 year: 2010 ident: 10.1016/j.dam.2015.04.029_br000215 article-title: Dense subgraphs with restrictions and applications to gene annotation graphs – ident: 10.1016/j.dam.2015.04.029_br000085 |
| SSID | ssj0001218 ssj0000186 ssj0006644 |
| Score | 2.2942858 |
| Snippet | We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 145 |
| SubjectTerms | Clique relaxations Fixed-parameter algorithms NP-hard problems Subgraph enumeration |
| Title | An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems |
| URI | https://dx.doi.org/10.1016/j.dam.2015.04.029 |
| Volume | 193 |
| WOSCitedRecordID | wos000359174700014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6771 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELbKxsN4mPipDQbyA09UkfI7zmPFNgGCCWlDylvkOBfI1CVT044Kif-du9hOAwUESLxEVVpXju_L-bvz-TNjz5USJSgoHT_1waEZw5FxUuIbL0QYSFEWWmf2bXJ2JrIsfT-ZfLV7YW7mSdOI9Tq9_q-mxntobNo6-xfmHv4Ub-BnNDpe0ex4_SPDz5qpnH9sMej_RHXvla2-6gsKq3qNI6YIFoaBt-gzrsxmTEp-oIdZdDDthay7qTQkFRkqOii8362K_qupOYmmG7Pb4xqdELLwgdu-G0RhN2tG7dWqq-Fzrb5sxA1GGD2nHL3eRdSsTD2_yUp40VDfZlJlW9tldPYyjh3kFJmefLTHFYnvxIk-h2VwyWkwcqqeFpw087Onxdu3XL_OQlxil0hgwIt6BVuTTfleUfuc-kHdQDJM8W52i-36SZSiU9ydvT7J3oz0x0hcb89m7DYLVEjUQiMbr5_ILpj3pYM_dOHnlGdEYy7usn0Tf_CZxs09NoHmPrszstMD1s4aPkIQHxDEEUF8C0F8jCBeN1wjiGsEcYMgvmx5jyBuEcQtgh6yD6cnFy9fOeZcDkcFgbt0QEWerIpIShcqT7lhUEjkoa6E0lMFCCjctIBSukFUUfgeU4yN84Ai5V2IIXjEdpq2gQPGEx8iARFQiiZUVYkepfSqGCiSQG4aHDLXDl2ujGg9nZ0yz2114mWOo53TaOdumONoH7IXQ5Nrrdjyux-H1h65oZyaSuYIq183e_xvzZ6wvc27csR2losVPGW31c2y7hbPDPi-AZO1p-Q |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+algorithmic+framework+for+fixed-cardinality+optimization+in+sparse+graphs+applied+to+dense+subgraph+problems&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Komusiewicz%2C+Christian&rft.au=Sorge%2C+Manuel&rft.date=2015-10-01&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=193&rft.spage=145&rft.epage=161&rft_id=info:doi/10.1016%2Fj.dam.2015.04.029&rft.externalDocID=S0166218X1500222X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon |