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

      The cluster deletion problem for cographs

      , ,
      Discrete Mathematics
      Elsevier BV

      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.

          Related collections

          Most cited references11

          • Record: found
          • Abstract: not found
          • Article: not found

          The ellipsoid method and its consequences in combinatorial optimization

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Correlation Clustering

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The intersection graphs of subtrees in trees are exactly the chordal graphs

                Bookmark

                Author and article information

                Journal
                Discrete Mathematics
                Discrete Mathematics
                Elsevier BV
                0012365X
                December 2013
                December 2013
                : 313
                : 23
                : 2763-2771
                Article
                10.1016/j.disc.2013.08.017
                c3b00cbb-b1b5-4a58-a86f-16e0546531f0
                © 2013
                History

                Comments

                Comment on this article