图上令牌交换问题的多项式时间算法

IF 1.8 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Rairo-Operations Research Pub Date : 2023-09-05 DOI:10.1051/ro/2023134

Caio Segawa Tonetti, Vinicius Santos, Sebastián Urrutia

{"title":"图上令牌交换问题的多项式时间算法","authors":"Caio Segawa Tonetti, Vinicius Santos, Sebastián Urrutia","doi":"10.1051/ro/2023134","DOIUrl":null,"url":null,"abstract":"The reconfiguration framework models the concept of transformation of combinatorial objects under a variety of operations and constraints.When it comes to reconfiguration challenges, the questions of importance are connectivity, diameter and distance, which can be considered and restrained in many ways.This work focuses on the Token Swap problem, a reconfiguration problem with variations that even precede the systematic study of the reconfiguration framework. In this problem, the goal is to convert an initial token placement on the vertices of a graph into a target token placement with the minimum number of swap operations.The main result of this paper is the construction of a polynomial algorithm for threshold graphs and subsequently cographs.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"82 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial time algorithms for the Token Swapping Problem on cographs\",\"authors\":\"Caio Segawa Tonetti, Vinicius Santos, Sebastián Urrutia\",\"doi\":\"10.1051/ro/2023134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The reconfiguration framework models the concept of transformation of combinatorial objects under a variety of operations and constraints.When it comes to reconfiguration challenges, the questions of importance are connectivity, diameter and distance, which can be considered and restrained in many ways.This work focuses on the Token Swap problem, a reconfiguration problem with variations that even precede the systematic study of the reconfiguration framework. In this problem, the goal is to convert an initial token placement on the vertices of a graph into a target token placement with the minimum number of swap operations.The main result of this paper is the construction of a polynomial algorithm for threshold graphs and subsequently cographs.\",\"PeriodicalId\":54509,\"journal\":{\"name\":\"Rairo-Operations Research\",\"volume\":\"82 1\",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rairo-Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023134\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rairo-Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1051/ro/2023134","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

重构框架对组合对象在各种操作和约束条件下的转换概念进行了建模。当涉及到重新配置的挑战时，重要的问题是连通性、直径和距离，这些问题可以通过多种方式加以考虑和限制。这项工作的重点是令牌交换问题，这是一个具有变化的重新配置问题，甚至在重新配置框架的系统研究之前。在这个问题中，目标是将图形顶点上的初始令牌放置转换为具有最少交换操作数量的目标令牌放置。本文的主要成果是构造了一个用于阈值图和后续图的多项式算法。

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

查看原文本刊更多论文

Polynomial time algorithms for the Token Swapping Problem on cographs

The reconfiguration framework models the concept of transformation of combinatorial objects under a variety of operations and constraints.When it comes to reconfiguration challenges, the questions of importance are connectivity, diameter and distance, which can be considered and restrained in many ways.This work focuses on the Token Swap problem, a reconfiguration problem with variations that even precede the systematic study of the reconfiguration framework. In this problem, the goal is to convert an initial token placement on the vertices of a graph into a target token placement with the minimum number of swap operations.The main result of this paper is the construction of a polynomial algorithm for threshold graphs and subsequently cographs.

求助全文

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

来源期刊

Rairo-Operations Research 管理科学-运筹学与管理科学

CiteScore

3.60

自引率

22.20%

发文量

206

审稿时长

>12 weeks

期刊介绍： RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.