descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 2010 English Publisher:Elsevier BVJournal:Information Processing Letters, volume 110, pages 635-638 (issn: 0020-0190,

Authors: Backer, Jonathan; Keil, J. Mark;

doi: 10.1016/j.ipl.2010.05.011

Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Saskatchewan
Canada

Keywords

bipartite permutation graph, proper interval graph, Graph algorithms (graph-theoretic aspects), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Density (toughness, etc.), densest subgraph, approximation algorithms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average