7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The Dense k -Subgraph Problem

      , ,
      Algorithmica
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Author and article information

          Journal
          Algorithmica
          Algorithmica
          Springer Nature
          0178-4617
          1432-0541
          March 2001
          March 2001
          : 29
          : 3
          : 410-421
          Article
          10.1007/s004530010050
          428b6e37-695b-40a2-a879-6c738f261045
          © 2001
          History

          Comments

          Comment on this article

          scite_
          0
          0
          0
          0
          Smart Citations
          0
          0
          0
          0
          Citing PublicationsSupportingMentioningContrasting
          View Citations

          See how this article has been cited at scite.ai

          scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

          Similar content2,282

          Cited by71