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

      Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

      ,
      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.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: not found
          • Book: not found

          Graph Theory with Applications

            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Parameterized Complexity

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

              Finding and counting given length cycles

                Bookmark

                Author and article information

                Journal
                Algorithmica
                Algorithmica
                Springer Nature
                0178-4617
                1432-0541
                August 2009
                July 2008
                : 54
                : 4
                : 544-556
                Article
                10.1007/s00453-008-9204-0
                acac00b9-2498-4e6a-8465-42880de57ef7
                © 2009
                History

                Comments

                Comment on this article