| 图的侧廓问题的一些界(英文) |
| |
| 引用本文： | 郝建修.图的侧廓问题的一些界(英文)[J].河南科学,2007,25(2):194-196. |
| |
| 作者姓名： | 郝建修 |
| |
| 作者单位： | 浙江师范大学,数学系,浙江,金华,321004 |
| |
| 基金项目： | National The Project Supported by Zhejiang Provincial Natural Science Foundation of China
,
国家自然科学基金
,
The Foundation of Zhejiang Universities Youth Teachers |
| |
| 摘 要： | 侧廓问题是:寻找一个从V(G)到正整数集合｛1,2,…,│V(G)│｝的一个一一对应,让x∈V(G)∑ (f(x)-min f(y)尽可能小,这里y∈N*(x),N*(x)是x的闭领域.本文提供这个问题的两个结果.
|
| 关 键 词： | 稀疏矩阵 侧廓 标号 轮廓 线性布置 |
| 文章编号： | 1004-3918(2007)02-0194-03 |
| 修稿时间： | 2006-09-08 |
Some Bounds on the Profile of Graphs |
| |
| HAO Jian-xiu.Some Bounds on the Profile of Graphs[J].Henan Science,2007,25(2):194-196. |
| |
| Authors: | HAO Jian-xiu |
| |
| Institution: | Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China |
| |
| Abstract: | The profile minimization problem is to find a one-to-one mapping(f) from the vertex set V(G)of a graph G to the set of positive integers{1,2…|V(G)|}such that ∑x∈V(G)(f(x)-minf(y)is as small as possible,where N*(x) is the closed neighborhood of x in G. This paper presents two results on the problem. |
| |
| Keywords: | sparse matrix profile labeling skyline linear layout |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
