排序方式: 共有57条查询结果,搜索用时 15 毫秒
31.
32.
33.
对给定的连通图G,树图T(G)的Hamilton性,首先由Cummins所证明。稍后,Kamae给出另一构造证明,并用于树的生成。本文将研究一个赋权图G所有最小树的一些性质。主要结果如下:(1)对任意赋权图G,证明了最小树图T_(min)(G)的Hamilton性;(2)根据构造性证明,给出生成全部最小树的算法。 相似文献
34.
The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges is minimized. This paper presents an approach based on the degree sequence of G for determining the exact value of cutwidth of typical graphs (e. g. , n-cube,cater-pillars). Relations between the cutwidth and other graph-theoretic parameters are studied as well. 相似文献
35.
本文讨论六角系统中将宽度与直径结合起来的几个极值问题,并给出相应的极图构造。最后,指出并补正[4]中一个计数结果的不足。 相似文献
36.
37.
38.
39.
二维带宽的浓度下界(英) 总被引:4,自引:0,他引:4
二维带宽问题是确定图G在平面格子图中的一个嵌入,使最长的边尽可能短.本文研究若干个下界以及它们应用于带宽的估值.所有结果均建立在一种平面组合几何的方法之上.其中的浓度下界改进了文献[3]的结果. 相似文献
40.
The single machine parallel batch problem with job compatibility is considered to minimize makespan,where the job compatibility constraints are represented by a graph G.This problem is proved to be NP-hard.And when the graph G is limited to be a general bipartite,a complete bipartite and a complete m-partite graph,these problems are solved in polynomial time respectively. 相似文献