位置：成果数据库 > 期刊 > 期刊详情页
The semidefinite programming based approximation algorithms for Max Hypergraph Cut with limited unba
  • ISSN号：1674-7283
  • 期刊名称：Science China Mathematics
  • 时间：2014
  • 页码：2337-2462
  • 相关项目：关于图顶点划分的 Thomassen 猜想
作者： 许宝刚|Xingxing Yu|张晓岩|Zanbo Zhang|
同期刊论文项目
关于图顶点划分的 Thomassen 猜想
期刊论文 23
同项目期刊论文
On a graph partition problem of Kuhn and Osthus
二部平衡公平划分的下个下界
On Some Properties of Cages
Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five
Forbiden subgraphs and 3-colorings
On the complexity of injective colorings and its generalizations
Edge choosability and total choosability of toroidal graphs without intersecting triangles
On minimum balanced bipartitions of triangle-free graphs
A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits
Maximum directed cuts in graphs with degree constraints
Injective choosability of planar graphs of girth five and six
On a graph partition result of Kuhn and Osthus
Bipartition of graphs under degree constrains
On judicious partitions of graphs
On judicious bisections of graphs
Maximum balanced 3-partitions of graphs
Acyclic edge coloring of planar graphs without adjacent cycles
图的划分：一些进展与未解决问题