| Title: | Isomorphism testing of k-spanning tournaments is fixed parameter tractable |
|---|
| Authors: | ID Arvind, Vikraman (Author)
ID Ponomarenko, Ilia (Author)
ID Ryabov, Grigory (Author) |
|---|
| Files: |  ADAM_Arvind,Ponomarenko,Ryabov_2025.pdf (379,74 KB)
MD5: BFC98983940DB929F710F3F410770077
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | An arc-colored tournament is said to be k-spanning for an integer k ≥ 1 if the union of its arc-color classes of maximal valency at most k is the arc set of a strongly connected digraph. It is proved that isomorphism testing of k-spanning tournaments is fixed-parameter tractable. |
|---|
| Keywords: | graph isomorphism problem, colored tournaments, fixed-parameter tractable algorithm |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 07.04.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 9 str. |
|---|
| Numbering: | Vol. 8, no. 2, [article no.] P2.10 |
|---|
| PID: | 20.500.12556/RUP-22072  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 2590-9770 |
|---|
| DOI: | https://doi.org/10.26493/2590-9770.1712.3ec |
|---|
| Publication date in RUP: | 03.11.2025 |
|---|
| Views: | 194 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
