40
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      SOFSEM 2013: Theory and Practice of Computer Science 

      Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

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

          Related collections

          Most cited references20

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

          Extremal Graph Theory

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

            Incidence matrices and interval graphs

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

              On rigid circuit graphs

              G. Dirac (1961)
                Bookmark

                Author and book information

                Book Chapter
                2013
                : 268-279
                10.1007/978-3-642-35843-2_24
                2fc0e163-a6da-4cd5-95b3-97765cf5eb26
                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,280

                Cited by3