Work

Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom

Year: 2025

Type: article

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.

Source: Repository of the University of Primorsk (University of Primorska)

Authors: Arvind, Vikraman, Ponomarenko, Ilia, Ryabov, Grigory

Institutions: Institute of Mathematical Sciences, St. Petersburg Department of Steklov Institute of Mathematics

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Israel Science Foundation

Award: G7644630718

OpenAlex ID: W7115203994

FWCI:

Cites:

Cited by:

Related to: