你即將離開本站

並前往https://arxiv.org/abs/1708.09141

Cycle Decompositions and Constructive Characterizations

Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an ...

確定！ 回上一頁

查詢 「Cycle decomposition」的人也找了：

  1. Disjoint cycle
    2.
  2. Permutation
    3.
  3. Permutation decomposition transposition
    4.
  4. Cycle decomposition
    5.
  5. disjoint cycle中文
    6.
  6. Cycle notation
    7.
  7. Permutation order
    8.
  8. Permutation conjugate
    9.