"multiflow" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "multi",
        "3": "flow"
      },
      "expansion": "multi- + flow",
      "name": "pre"
    }
  ],
  "etymology_text": "multi- + flow",
  "forms": [
    {
      "form": "multiflows",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "multiflow (plural multiflows)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with multi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2008, Guyslain Naves, András Sebő, “Multiflow Feasibility: An Annotated Tableau”, in William J. Cook, László Lovász, Jens Vygen, editors, Research Trends in Combinatorial Optimization, Berlin: Springer, page 266",
          "text": "For vertex-capacitated multiflows the unary case has to be distinguished from vertex-disjoint paths if G is restricted for instance to planar graphs.",
          "type": "quotation"
        },
        {
          "ref": "2010, Bernhard Hämmerli, Critical Information Infrastructures Security, page 32",
          "text": "Given that several dependency types flow through the networks, multicommodity flows or multiflows is a natural theoretical framework to map the presented model for further investigations.",
          "type": "quotation"
        },
        {
          "ref": "2020, Naveen Garg, Nikhil Kumar, András Sebő, “Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation”, in Daniel Bienstock, Giacomo Zambelli, editors, Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings (Lecture Notes in Computer Science; 12125), Cham: Springer Nature, page 148",
          "text": "Despite these restricted multiflows, the gap between integer and half-integer flow is at least 1/2 for these graphs […]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A flow function that operates on the set of edges (ordered pairs of vertices) on the intersection of two related directed graphs."
      ],
      "id": "en-multiflow-en-noun-zhGO59pA",
      "links": [
        [
          "graph theory",
          "graph theory"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A flow function that operates on the set of edges (ordered pairs of vertices) on the intersection of two related directed graphs."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "multiflow"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "multi",
        "3": "flow"
      },
      "expansion": "multi- + flow",
      "name": "pre"
    }
  ],
  "etymology_text": "multi- + flow",
  "forms": [
    {
      "form": "multiflows",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "multiflow (plural multiflows)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with multi-",
        "English terms with quotations",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2008, Guyslain Naves, András Sebő, “Multiflow Feasibility: An Annotated Tableau”, in William J. Cook, László Lovász, Jens Vygen, editors, Research Trends in Combinatorial Optimization, Berlin: Springer, page 266",
          "text": "For vertex-capacitated multiflows the unary case has to be distinguished from vertex-disjoint paths if G is restricted for instance to planar graphs.",
          "type": "quotation"
        },
        {
          "ref": "2010, Bernhard Hämmerli, Critical Information Infrastructures Security, page 32",
          "text": "Given that several dependency types flow through the networks, multicommodity flows or multiflows is a natural theoretical framework to map the presented model for further investigations.",
          "type": "quotation"
        },
        {
          "ref": "2020, Naveen Garg, Nikhil Kumar, András Sebő, “Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation”, in Daniel Bienstock, Giacomo Zambelli, editors, Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings (Lecture Notes in Computer Science; 12125), Cham: Springer Nature, page 148",
          "text": "Despite these restricted multiflows, the gap between integer and half-integer flow is at least 1/2 for these graphs […]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A flow function that operates on the set of edges (ordered pairs of vertices) on the intersection of two related directed graphs."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A flow function that operates on the set of edges (ordered pairs of vertices) on the intersection of two related directed graphs."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "multiflow"
}