《朋友和陌生人》是完整的pspace

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2025-03-03 DOI:10.1016/j.ipl.2025.106573

Chao Yang , Zhujun Zhang

{"title":"《朋友和陌生人》是完整的pspace","authors":"Chao Yang , Zhujun Zhang","doi":"10.1016/j.ipl.2025.106573","DOIUrl":null,"url":null,"abstract":"<div><div>The friends-and-strangers problem is defined on two graphs X and Y of the same order n, where X is the location graph on a set of locations <math><mi>V</mi><mo>(</mo><mi>X</mi><mo>)</mo></math> and Y is the friendship graph on a set of people <math><mi>V</mi><mo>(</mo><mi>Y</mi><mo>)</mo></math>. A configuration is a bijection from <math><mi>V</mi><mo>(</mo><mi>X</mi><mo>)</mo></math> to <math><mi>V</mi><mo>(</mo><mi>Y</mi><mo>)</mo></math>, representing an arrangement of n people at n locations. The friends-and-stranger problem investigates the connectivity of two arbitrary configurations by a sequence of swaps of two people that are neighbors (i.e., adjacent in X) and friends (i.e., adjacent in Y). In this paper, we show that the friends-and-strangers problem with subcubic planar location graphs X is PSPACE-complete by a reduction from the Ncl (non-deterministic constraint logic) problem.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106573"},"PeriodicalIF":0.7000,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Friends-and-strangers is PSPACE-complete\",\"authors\":\"Chao Yang , Zhujun Zhang\",\"doi\":\"10.1016/j.ipl.2025.106573\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The friends-and-strangers problem is defined on two graphs X and Y of the same order n, where X is the location graph on a set of locations <math><mi>V</mi><mo>(</mo><mi>X</mi><mo>)</mo></math> and Y is the friendship graph on a set of people <math><mi>V</mi><mo>(</mo><mi>Y</mi><mo>)</mo></math>. A configuration is a bijection from <math><mi>V</mi><mo>(</mo><mi>X</mi><mo>)</mo></math> to <math><mi>V</mi><mo>(</mo><mi>Y</mi><mo>)</mo></math>, representing an arrangement of n people at n locations. The friends-and-stranger problem investigates the connectivity of two arbitrary configurations by a sequence of swaps of two people that are neighbors (i.e., adjacent in X) and friends (i.e., adjacent in Y). In this paper, we show that the friends-and-strangers problem with subcubic planar location graphs X is PSPACE-complete by a reduction from the Ncl (non-deterministic constraint logic) problem.</div></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"190 \",\"pages\":\"Article 106573\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019025000171\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019025000171","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

朋友和陌生人问题定义在两个同阶的图X和图Y上，其中X是一组位置V(X)上的位置图，Y是一组人V(Y)上的友谊图。配置是从V(X)到V(Y)的映射，表示n个人在n个位置的排列。朋友-陌生人问题研究了两个任意构型的连通性，通过交换两个相邻的人（即在X中相邻）和朋友（即在Y中相邻）。本文通过对Ncl（非确定性约束逻辑）问题的简化，证明了具有次立方平面位置图X的朋友-陌生人问题是PSPACE-complete的。

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

查看原文本刊更多论文

Friends-and-strangers is PSPACE-complete

The friends-and-strangers problem is defined on two graphs X and Y of the same order n, where X is the location graph on a set of locations

V (X)

and Y is the friendship graph on a set of people

V (Y)

. A configuration is a bijection from

V (X)

V (Y)

, representing an arrangement of n people at n locations. The friends-and-stranger problem investigates the connectivity of two arbitrary configurations by a sequence of swaps of two people that are neighbors (i.e., adjacent in X) and friends (i.e., adjacent in Y). In this paper, we show that the friends-and-strangers problem with subcubic planar location graphs X is PSPACE-complete by a reduction from the Ncl (non-deterministic constraint logic) problem.

求助全文

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

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.