Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom

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.

Publication Details

Journal
Repository of the University of Primorsk (University of Primorska)
Published
2025-04-07
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom

Repository of the University of Primorsk (University of Primorska)
Advanced Graph Theory Research
article

Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom

article en

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.

Repository of the University of Primorsk (University of Primorska)
Openalex Percentile: Top 30%
Advanced Graph Theory Research
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom · Repository of the University of Primorsk (University of Primorska) (2025) | TGRS Research Map | TGRS