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

      Link scheduling in polynomial time

      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

          Most cited references10

          • 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

            Maximum matching and a polyhedron with 0,1-vertices

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

              The NP-Completeness of Edge-Coloring

              Ian Holyer (1981)
                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Information Theory
                IEEE Trans. Inform. Theory
                Institute of Electrical and Electronics Engineers (IEEE)
                00189448
                Sept. 1988
                : 34
                : 5
                : 910-917
                Article
                10.1109/18.21215
                e25c5064-5616-473e-a5e2-5c6941b12687
                History

                Comments

                Comment on this article