图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS]

图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] 下载 mobi epub pdf 电子书 2024


简体网页||繁体网页
张晓岩,张赞波 著



点击这里下载
    


想要找书就要到 图书大百科
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

发表于2024-11-05

类似图书 点击查看全场最低价

图书介绍

出版社: 科学出版社
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 电子书 格式

图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] mobi 下载 pdf 下载 pub 下载 txt 电子书 下载 2024

图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] 下载 mobi pdf epub txt 电子书 格式 2024

图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] 下载 mobi epub pdf 电子书
想要找书就要到 图书大百科
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

用户评价

评分

评分

评分

评分

评分

评分

评分

评分

评分

类似图书 点击查看全场最低价

图论中的图分割与图匹配问题(英文版) [SOME ADVANCED TOPICS OF GRAPH PARTITIONING AND MATCHING PROBLEMS] mobi epub pdf txt 电子书 格式下载 2024


分享链接








相关图书


本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

友情链接

© 2024 book.teaonline.club All Rights Reserved. 图书大百科 版权所有