中文摘要：

阐述了图核的全局信息在结点匹配中的应用，将图核理论扩展到超图上，提出了超图的核等相关概念，并给出了超图核值的形式化描述；分析了超图k水平p-核的构造性属性，给出了求解超图核值算法的基本步骤，进而讨论了降低时间复杂度的改进措施，提出了基于结点属性函数快速求解超图核值的算法框架；重点阐述了无向超图的改进压缩存储格式，将无向超图核值的求解算法从结点的度属性扩展到不同的结点属性函数，并给出了基于该存储格式的结点属性函数P5（v，u）核值求解算法，其时间复杂度为O（m），空间复杂度为0（n＋m＋Z）；最后，基于ISPD98测试基准的18组无向超图进行了结点的度和核值的求解对比实验，其数据对比表明：核值相比结点的度更能反映出结点在超图中的重要程度．

英文摘要：

The core notion of graph and its application in matching schemes is introduced, which can be extended to hypergraph. First-ly, the core notion of hypergraph is proposed and its formal description is presented. Secondly, we analyze the constructive property of p-core at level k and give the solution steps of cores decomposition for hypergraph. We also discuss the improvement of its time complexity and propose the outline of the rapid algorithm for cores decomposition based on the vertex property function of hyperg-raph. Thirdly, we describe the improved compressed storage format （ ICSF） of undirected hypergraph and promote the cores decom- position from the degree of vertex to the property function of vertex. Furthermore, we present the pseudocode of cores decomposition algorithm of vertex property functions p5 （v, U） based on the ICSF of undirected hypergraph, whose time complexity is O （m） and space complexity is O （ n ＋ m ＋ z ）. Finally, we carry out the comparative experiment between degree and core of vertex based on 18 hypergraphs of ISPD98 benchmark. The experiment and analysis show the core of vertex can more nearly reflect the importance of nodes in the hypergraph than the degree of vertex.