基于种植分区模型的图分区算法

Random Struct. Algorithms Pub Date : 1999-08-08 DOI:10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2

A. Condon, R. Karp

{"title":"基于种植分区模型的图分区算法","authors":"A. Condon, R. Karp","doi":"10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2","DOIUrl":null,"url":null,"abstract":"The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups.","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"125 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"497","resultStr":"{\"title\":\"Algorithms for graph partitioning on the planted partition model\",\"authors\":\"A. Condon, R. Karp\",\"doi\":\"10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups.\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"125 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"497\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 497

摘要

NP-hard图的二分问题是将无向图的节点划分为两个大小相等的组，以使穿过该分区的边的数量最小。更一般的图的l划分问题是将无向图的节点划分为l个大小相等的组，以使组间交叉的边的总数最小。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algorithms for graph partitioning on the planted partition model

The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量