点击选择搜索分类
首页 - 港台图书- 正文
☆☆☆☆☆
||
张晓岩,张赞波 著
出版社: 科学出版社 ISBN:9787030495020 版次:1 商品编码:12114972 包装:平装 外文名称:SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS 开本:16开 出版时间:2017-01-01 用纸:胶版纸 页数:150 正文语种:英文
Chapter 1 contains a short general introduction to the topics of the book and gives an overview of the main results, together with some motivation and connections to and relationships with older results. Specific terminology and notation can be found just before each of the topic8.
In Chapter 2, we first investigate the computational complexity of problems of determining the minimum number of monochromatic cliques or rainbow cycles that, respectively, partition the vertex set V(G) of a graph G. We show that the minimum monochromatic clique partition problem is APX-hard on K4 -free graphs and monochromatic-K4 -free graphs, and APX-complete on monochromatic-K4 - free graphs in which the size of a max:imum monochromatic clique is bounded by a constant. We also show that the minimum rainbow cycle partition problem is NP-complete, even if the input graph G is triangle-free. Moreover, for the weighted version of the minimum monochromatic clique partition problem on monochromatic-K4 -free graphs, we derive an approximation algorithm with (tight) approximation guarantee In |V (G)|+1.
Chapter 1 contains a short general introduction to the topics of the book and gives an overview of the main results, together with some motivation and connections to and relationships with older results. Specific terminology and notation can be found just before each of the topic8.
In Chapter 2, we first investigate the computational complexity of problems of determining the minimum number of monochromatic cliques or rainbow cycles that, respectively, partition the vertex set V(G) of a graph G. We show that the minimum monochromatic clique partition problem is APX-hard on K4 -free graphs and monochromatic-K4 -free graphs, and APX-complete on monochromatic-K4 - free graphs in which the size of a max:imum monochromatic clique is bounded by a constant. We also show that the minimum rainbow cycle partition problem is NP-complete, even if the input graph G is triangle-free. Moreover, for the weighted version of the minimum monochromatic clique partition problem on monochromatic-K4 -free graphs, we derive an approximation algorithm with (tight) approximation guarantee In |V (G)|+1.
图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] 电子书 下载 mobi epub pdf txt
图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS]-so88
图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] pdf epub mobi txt 电子书 下载 2022
图书介绍
☆☆☆☆☆
||
张晓岩,张赞波 著
出版社: 科学出版社 ISBN:9787030495020 版次:1 商品编码:12114972 包装:平装 外文名称:SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS 开本:16开 出版时间:2017-01-01 用纸:胶版纸 页数:150 正文语种:英文
内容简介
This work is our selected results of research on graph partitioning and matching problems in the field of theoretical computer science and structural graph theory in recent years. After an introductory chapter, the reader will find six chapters, each of which is written as a self-contained content. In the first part of the work, Chapter 2 through 4, we concentrate on the complexity, inapproximability, approximation algorithms and on-line algorithms of some graph vertex partitioning problems. In the second part of the work, Chapter 5 through 7, we focus on the structural properties of some graph problems related to matching wluch can be regarded as edge partitioning problems. We refer to the listed chapters for the details of the results.Chapter 1 contains a short general introduction to the topics of the book and gives an overview of the main results, together with some motivation and connections to and relationships with older results. Specific terminology and notation can be found just before each of the topic8.
In Chapter 2, we first investigate the computational complexity of problems of determining the minimum number of monochromatic cliques or rainbow cycles that, respectively, partition the vertex set V(G) of a graph G. We show that the minimum monochromatic clique partition problem is APX-hard on K4 -free graphs and monochromatic-K4 -free graphs, and APX-complete on monochromatic-K4 - free graphs in which the size of a max:imum monochromatic clique is bounded by a constant. We also show that the minimum rainbow cycle partition problem is NP-complete, even if the input graph G is triangle-free. Moreover, for the weighted version of the minimum monochromatic clique partition problem on monochromatic-K4 -free graphs, we derive an approximation algorithm with (tight) approximation guarantee In |V (G)|+1.
内页插图
目录
前言/序言
This work is our selected results of research on graph partitioning and matching problems in the field of theoretical computer science and structural graph theory in recent years. After an introductory chapter, the reader will find six chapters, each of which is written as a self-contained content. In the first part of the work, Chapter 2 through 4, we concentrate on the complexity, inapproximability, approximation algorithms and on-line algorithms of some graph vertex partitioning problems. In the second part of the work, Chapter 5 through 7, we focus on the structural properties of some graph problems related to matching wluch can be regarded as edge partitioning problems. We refer to the listed chapters for the details of the results.Chapter 1 contains a short general introduction to the topics of the book and gives an overview of the main results, together with some motivation and connections to and relationships with older results. Specific terminology and notation can be found just before each of the topic8.
In Chapter 2, we first investigate the computational complexity of problems of determining the minimum number of monochromatic cliques or rainbow cycles that, respectively, partition the vertex set V(G) of a graph G. We show that the minimum monochromatic clique partition problem is APX-hard on K4 -free graphs and monochromatic-K4 -free graphs, and APX-complete on monochromatic-K4 - free graphs in which the size of a max:imum monochromatic clique is bounded by a constant. We also show that the minimum rainbow cycle partition problem is NP-complete, even if the input graph G is triangle-free. Moreover, for the weighted version of the minimum monochromatic clique partition problem on monochromatic-K4 -free graphs, we derive an approximation algorithm with (tight) approximation guarantee In |V (G)|+1.
图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] 电子书 下载 mobi epub pdf txt
电子书下载地址:
相关电子书推荐:
- 文件名
- 纳米:革命与颠覆的时代——21世纪制高点
- 从零开始学造型:时尚卷(曲)发全图解 9787122306364
- 法布尔昆虫记
- 让孩子会学习 9787502189006 石油工业出版社
- 圆顶龙的逆袭-决战恐龙星球-2
- 国际服装备忘录(卷二) 9787811113600
- 环月飞行(插图版) 9787547046098
- 正版 学生问题个案诊疗69例 王晓春 长江文艺出版社 40年教育实战精华处理学生问题专业读本 经典案
- 满58包邮 推动丛书物理系列:亚原子粒子的发现 9787535795090 斯蒂芬温伯格
- 时尚新娘化妆造型专业教程 第2版
- 探秘海洋生物(全彩版)/科学眼 (日) 原田雅章著
- 满28包邮 女人会吃才漂亮
- 太阳能热利用技术
- 满28包邮 不靠体型靠造型(穿衣篇)
- “制冷在你身边”科普系列:制冷空调供暖实用知识365问