Files in this item
Structural and combinatorial properties of 2-swap word permutation graphs
Item metadata
dc.contributor.author | Adamson, Duncan | |
dc.contributor.author | Flaherty, Nathan | |
dc.contributor.author | Potapov, Igor | |
dc.contributor.author | Spirakis, Paul G. | |
dc.contributor.editor | Soto, José A. | |
dc.contributor.editor | Wiese, Andreas | |
dc.date.accessioned | 2024-07-25T09:36:30Z | |
dc.date.available | 2024-07-25T09:36:30Z | |
dc.date.issued | 2024-03-06 | |
dc.identifier | 302432842 | |
dc.identifier | c7b915dd-1a68-4a23-a5a2-988c0962fbd7 | |
dc.identifier | 85188729365 | |
dc.identifier.citation | Adamson , D , Flaherty , N , Potapov , I & Spirakis , P G 2024 , Structural and combinatorial properties of 2-swap word permutation graphs . in J A Soto & A Wiese (eds) , LATIN 2024 - Theoretical informatics : 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II . Lecture notes in computer science , vol. 14579 , Springer , Cham , pp. 61-76 , 16th Latin American Symposium on Theoretical Informatics, LATIN 2042 , Puerto Varas , Chile , 18/03/24 . https://doi.org/10.1007/978-3-031-55601-2_5 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783031556005 | |
dc.identifier.isbn | 9783031556012 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0003-3343-2435/work/160753720 | |
dc.identifier.uri | https://hdl.handle.net/10023/30263 | |
dc.description | Funding: This work is supported by the Leverhulme Research Centre for Functional Materials Design and EPSRC grants EP/P02002X/1, EP/R018472/1. | en |
dc.description.abstract | In this paper, we study the graph induced by the 2-swap permutation on words with a fixed Parikh vector. A 2-swap is defined as a pair of positions s=(i,j) where the word w induced by the swap s on v is v[1]v[2]⋯v[i-1]v[j]v[i+1]⋯v[j-1]v[i]v[j+1]⋯v[n]. With these permutations, we define the Configuration Graph, G(P) for a given Parikh vector. Each vertex in G(P) corresponds to a unique word with the Parikh vector P, with an edge between any pair of words v and w if there exists a swap s such that v∘s=w. We provide several key combinatorial properties of this graph, including the exact diameter of this graph, the clique number of the graph, and the relationships between subgraphs within this graph. Additionally, we show that for every vertex in the graph, there exists a Hamiltonian path starting at this vertex. Finally, we provide an algorithm enumerating these paths from a given input word of length n with a delay of at most O(log n) between outputting edges, requiring O(n log n) preprocessing. | |
dc.format.extent | 16 | |
dc.format.extent | 267077 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | LATIN 2024 - Theoretical informatics | en |
dc.relation.ispartofseries | Lecture notes in computer science | en |
dc.subject | Combinatorics on words | en |
dc.subject | Parikh vector | en |
dc.subject | Graph algorithms | en |
dc.subject | Permutation | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | Computer Science(all) | en |
dc.subject | Theoretical Computer Science | en |
dc.subject | T-NDAS | en |
dc.subject | MCC | en |
dc.subject.lcc | QA75 | en |
dc.title | Structural and combinatorial properties of 2-swap word permutation graphs | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-031-55601-2_5 | |
dc.identifier.url | https://livrepository.liverpool.ac.uk/id/eprint/3177264 | en |
dc.identifier.url | https://arxiv.org/abs/2307.01648v3 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.