Bokus

Yuefang Sun – författare

Visar alla böcker från författaren Yuefang Sun. Handla med fri frakt och snabb leverans.

4 produkter

  1. Xueliang Li, Yuefang Sun - Rainbow Connections of Graphs, Häftad. Tillgänglighet: Lägg i varukorg

    Rainbow Connections of Graphs

    Av Xueliang Li, Yuefang Sun

    Häftad, 2012

    551 kr

    Lägg i varukorg

    Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the …

  2. Yuefang Sun, Xueliang Li - Rainbow Connections of Graphs, E-bok. Tillgänglighet: Lägg i varukorg

    Rainbow Connections of Graphs

    Av Yuefang Sun, Xueliang Li

    E-bok, 2012

    542 kr

    Lägg i varukorg

    Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the …

  3. Yuefang Sun - Steiner Type Packing Problems in Digraphs, Häftad. Tillgänglighet: Lägg i varukorg

    Steiner Type Packing Problems in Digraphs

    Av Yuefang Sun

    Häftad, 2026

    551 kr

    Lägg i varukorg

    Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called …

  4. Yuefang Sun - Steiner Type Packing Problems in Digraphs, E-bok. Tillgänglighet: Lägg i varukorg

    Steiner Type Packing Problems in Digraphs

    Av Yuefang Sun

    E-bok, 2026

    710 kr

    Lägg i varukorg

    Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called …