A constant approximation algorithm for the densest k-subgraph problem on chordal graphs-Reference-Cited by-同舟云学术

A constant approximation algorithm for the densest k-subgraph problem on chordal graphs

Published:2008-09 Issue:1 Volume:108 Page:29-32
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Liazi Maria,Milis Ioannis,Zissimopoulos Vassilis

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference17 articles.

1. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 284–293

2. Greedily finding a dense subgraph;Asahiro;Journal of Algorithms,2000

3. A. Billionnet, F. Roupin, A deterministic algorithm for the densest k-subgraph problem using linear programming, Technical Report No. 486, CEDRIC, CNAM-IIE, Paris, 2004

4. Clustering and domination in perfect graphs;Corneil;Discrete Applied Mathematics,1984

5. On rigid circuit graphs;Dirac;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg,1961

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30

2. On the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs;SSRN Electronic Journal;2022

3. OpinionRank: Trustworthy Website Detection using Three Valued Subjective Logic;IEEE Transactions on Big Data;2020

4. Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem;Entropy;2019-01-24

5. Exact and superpolynomial approximation algorithms for the densest k-subgraph problem;European Journal of Operational Research;2017-11