{
  "broaderTermGeneral" : [ {
    "id" : "https://d-nb.info/gnd/4390818-4",
    "label" : "Optimierungsproblem"
  }, {
    "id" : "https://d-nb.info/gnd/4113782-6",
    "label" : "Graphentheorie"
  } ],
  "relatedDdcWithDegreeOfDeterminacy2" : [ {
    "id" : "http://dewey.info/class/519.6/",
    "label" : "http://dewey.info/class/519.6/"
  }, {
    "id" : "http://dewey.info/class/511.5/",
    "label" : "http://dewey.info/class/511.5/"
  } ],
  "describedBy" : {
    "id" : "https://d-nb.info/gnd/4483017-8/about",
    "maintainer" : {
      "id" : "https://ld.zdb-services.de/resource/organisations/DE-101",
      "label" : "https://ld.zdb-services.de/resource/organisations/DE-101"
    },
    "dctCreator" : {
      "id" : "https://ld.zdb-services.de/resource/organisations/DE-101",
      "label" : "https://ld.zdb-services.de/resource/organisations/DE-101"
    },
    "license" : {
      "id" : "http://creativecommons.org/publicdomain/zero/1.0/",
      "label" : "http://creativecommons.org/publicdomain/zero/1.0/"
    },
    "dateModified" : "2025-04-03T15:34:44.000",
    "descriptionLevel" : {
      "id" : "https://d-nb.info/standards/vocab/gnd/description-level#1",
      "label" : "Katalogisierungslevel 1"
    }
  },
  "definition" : [ "Optimierungsproblem aus der Graphentheorie: Unterteilung eines Graphen in zwei gleich große Teile, so daß die Anzahl der Kanten optimal wird." ],
  "gndIdentifier" : "4483017-8",
  "id" : "https://d-nb.info/gnd/4483017-8",
  "preferredName" : "Bisektionsproblem",
  "type" : [ "SubjectHeading", "AuthorityResource", "SubjectHeadingSensoStricto" ],
  "variantName" : [ "Graph / Bisektion / Optimierungsproblem" ],
  "@context" : "https://lobid.org/gnd/context.jsonld",
  "gndSubjectCategory" : [ {
    "id" : "https://d-nb.info/standards/vocab/gnd/gnd-sc#29",
    "label" : "Stochastik, Operations Research"
  } ],
  "oldAuthorityNumber" : [ "(DE-588c)4483017-8" ]
}