類似資料

• Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
  著者:: Liu, Bowie, 等
  出版事項: (2025)
• Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
  著者:: Foucaud, Florent, 等
  出版事項: (2025)
• On the complexity of finding a spanning even tree in a graph
  著者:: Hanaka, Tesshu, 等
  出版事項: (2024)
• Terminal Steiner tree problem : Complexity and Algorithms
  著者:: S, Jyothish, 等
  出版事項: (2026)
• Interdiction of minimum spanning trees and other matroid bases
  著者:: Weninger, Noah, 等
  出版事項: (2024)