首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的k-单圈划分中的优化问题
引用本文:傅超,刘彦佩.图的k-单圈划分中的优化问题[J].运筹学学报,2002,6(2):79-84.
作者姓名:傅超  刘彦佩
作者单位:北方交通大学应用数学系,北京,100044
基金项目:国家自然科学基金资助(批准号:69973001)
摘    要:图的划分问题曾引起图论界的广泛关注,在文献4]中讨论了k-单圈划分,本文进一步研究基于k-单圈划分的优化问题,即在一个赋权图中求一个最小权可k-单圈划分的支撑子图,以及对一个不存在k-单圈划分支撑子图的图,如何添最少的边使得它有k-单圈划分的支撑子图。

关 键 词:优化问题  k-单圈划分  最小权  最少边  简单图  赋权图
修稿时间:2001年2月22日

The Optimization of k-Unicyclicly Partitioning a Graph
CHAo FU YANPAI LIU.The Optimization of k-Unicyclicly Partitioning a Graph[J].OR Transactions,2002,6(2):79-84.
Authors:CHAo FU YANPAI LIU
Abstract:The problem of partitioning a graph has been long concered. In 4], k-unicyclic partition problem is discussed. More generally, we discuss the optimization of k-unicyclic partition in this paper. That is how to get a spanning subgraph which has a k-unicycle partition with minimum weight in a weighted graph, and how to add minimum edges to get a spanning supgraph with k-unicyclic partition in a graph, if the graph doesn't have a spanning subgraph with the partition.
Keywords:k-unicycle partition  optimization  minimum weight  minimum edges  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号