Skip to main content

5 Result(s)

within Maocheng Cai Remove this filter

and

  1. No Access

    Article

    On computational complexity of membership test in flow games and linear production games

    Let Γ≡(N,v) be a cooperative game with the player set N and characteristic function v: 2N→R. An imputation of the game is in the core if no subset of players could gain advantage by splitting from the grand coal...

    Qizhi Fang, Shanfeng Zhu, Maocheng Cai… in International Journal of Game Theory (2002)

  2. No Access

    Chapter and Conference Paper

    Membership for Core of LP Games and Other Games

    Let Γ = (N, v) be a cooperative game with the player set N and characteristic function v: 2N → R. An imputation of the game is in the core if no subset of players could gain advantage by splitting from the grand ...

    Qizhi Fang, Shanfeng Zhu, Maocheng Cai, **aotie Deng in Computing and Combinatorics (2001)

  3. No Access

    Article

    Tree decomposition

    A tree decomposition of graphG = (V, E) is referred to as a partition of edge setE into edge-disjoint trees. Given (not necessarily distinct) vertices u1, u2 ⋯ uk∈V with k⩾2, a sufficient and necessary condition ...

    Xudong Yuan, Maocheng Cai in Chinese Science Bulletin (1998)

  4. No Access

    Article

    A [k,k+1]-factor containing given Hamiltonian cycle

    Letk⩾2 be an integer and let G be a graph of ordern with minimum degree at leastk, n⩾8k -16 for evenn and n⩾6k - 13 for oddn. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for an...

    Maocheng Cai, Yanjun Li, M. Kano in Science in China Series A: Mathematics (1998)

  5. No Access

    Article

    Minus domination number in cubic graph

    An upper bound is established on the parameter Γ− (G) for a cubic graphG and two infinite families of 3-connected graphs Gk, Gk* are constructed to show that the bound is sharp and, moreover, the difference Γ−(Gk

    Liying Kang, Maocheng Cai in Chinese Science Bulletin (1998)