点击选择搜索分类
首页 - 套装书- 正文
☆☆☆☆☆
||
张晓岩,张赞波 著
出版社: 科学出版社 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
电子书下载地址:
相关电子书推荐:
- 文件名
- {RT}VEX EDR机器人创客教程-覃祖军 机械工业出版社 9787111577553
- 现货包邮 全国青少年户外营地丛书 营地指导员基础教程+营地建设与管理+自然教育操作手册 共3本
- 世界科普巨匠经典译丛:驯服任性的自然 9787542762757
- Jolly Phonics: Resources CD
- 中国平方公里阵科学目标 科普读物 书籍
- 电路PSpice仿真实训教程(附光盘1张)
- 你不是病人—— 来自癌症哲学门诊的处方笺
- The Sports Gene: Inside the Science of Ext...
- 走进奇妙的元素周期表 9787544288699 (日)吉田隆嘉-RT
- 北斗与GNSS系统概论
- 叶永烈科普全集(28卷) 叶永烈
- 专项职业能力考核培训教材:光纤到户(FTTH)安装调试
- 正版 星际穿越 【美】基普·索恩(Kip Thorne)著 ,苟利军 978721306
- 美国直邮 英文原版儿童图书 金门大桥 旧金山大桥 儿童小说 5-7岁
- 别逗了费曼先生 RP费曼