Skip to main navigation Skip to search Skip to main content

Degree-constrained subgraph problems: Hardness and approximation results

  • Omid Amini
  • , David Peleg
  • , Stéphane Pérennes
  • , Ignasi Sau
  • , Saket Saurabh
  • Max Planck Institute for Informatics
  • Weizmann Institute of Science
  • I3S-CNRS, Algorithmes
  • Polytechnic University of Catalonia
  • University of Bergen

Research output: Contribution to journal › Conference article › peer-review

16 Scopus citations

Fingerprint

Dive into the research topics of 'Degree-constrained subgraph problems: Hardness and approximation results'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics