Isbn: 9786200984722 (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

  • Con foto (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Editore: OmniScriptum, 2026

    6200984727 / 9786200984722

    • Brossura
    • Print on Demand

    Da: preigu, Osnabrück, Germaniapreigu

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 109,85

    EUR 70,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 5 disponibili

    Taschenbuch. Condizione: Neu. Flow Network | Graph theory, Function (mathematics), Graph (mathematics) | Aaron Philippe Toll | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786200984722 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

  • Editore: Omniscriptum Jun 2026, 2026

    6200984727 / 9786200984722

    • Brossura
    • Print on Demand

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 136,00

    EUR 60,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware OmniScriptum SRL, Str. Armeneasca 28/1, office 1, 2012 Chisinau 84 pp. Englisch.

  • Editore: Omniscriptum

    6200984727 / 9786200984722

    • Brossura
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 189,66

    EUR 30,50 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a network, the vertices are called nodes and the edges are called arcs. A flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it, except when it is a source, which has more outgoing flow, or sink, which has more incoming flow. A network can be used to model traffic in a road system, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes.