„hypergraph cut“

Suchergebnisse

32 Treffer

• A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
  Miller, Zevi ; Sudborough, I. H.
• Max Horn SAT and the minimum cut problem in directed hypergraphs
  Gallo, G. ; Gentile, C. ; Pretolani, D. ; Rago, G.
• Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
  Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Wang, Weihang
• The cut method on hypergraphs for the Wiener index
  Klavžar, Sandi ; Romih, Gašper Domen
• Hypergraph cuts with edge-dependent vertex weights
  Zhu, Yu ; Segarra, Santiago
• A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
  Sun, Jian ; Zhang, Zan-Bo ; Chen, Yannan ; Han, Deren ; Du, Donglei ; Zhang, Xiaoyan
• On the Maximal Cut in a Random Hypergraph
  Zakharov, P. A. ; Shabanov, D. A.
• Multicriteria cuts and size-constrained k-cuts in hypergraphs
  Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Xu, Chao
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
  Fan, Yizheng ; Zhu, Zhu ; Wang, Yi
• Hypergraph k-cut in randomized polynomial time
  Chandrasekaran, Karthekeyan ; Xu, Chao ; Yu, Xilin
• A simple hypergraph min cut algorithm
  Klimmek, Regina ; Wagner, Frank 1996 Freie Univ., Fachbereich Mathematik
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
  Xu, BaoGang ; Yu, XingXing ; Zhang, XiaoYan ; Zhang, Zan-Bo