e6cce43223a94001f499 · Cut it out!

{
  "title_en": "Cut it out!",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2009-05-01",
  "date_original": "May 1, 2009",
  "url": "https://www.nist.gov/publications/cut-it-out",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Isabel M. Beichl , Francis Sullivan",
  "abstract_excerpt_en": "This is a tutorial article on a probabilistic method for finding minimum cut sets of a connected graph.",
  "id": "e6cce43223a94001f499",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "Cut it out!",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2009-05-01",
      "date_original": "May 1, 2009",
      "url": "https://www.nist.gov/publications/cut-it-out",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Isabel M. Beichl , Francis Sullivan",
      "abstract_excerpt_en": "This is a tutorial article on a probabilistic method for finding minimum cut sets of a connected graph."
    }
  ],
  "translation_state": "none"
}