Stable gonality is computable

by   Ragnar Groot Koerkamp, et al.

Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number of edges mapped to each edge of the tree. This parameter is related to treewidth, but unlike treewidth, it distinguishes multigraphs from their underlying simple graphs. Stable gonality is relevant for problems in number theory. In this paper, we show that deciding whether the stable gonality of a given graph is at most a given integer k belongs to the class NP, and we give an algorithm that computes the stable gonality of a graph in O((1.33n)^nm^m poly(n,m)) time.



page 1

page 2

page 3

page 4


Stable divisorial gonality is in NP

Divisorial gonality and stable divisorial gonality are graph parameters,...

Minimum Spanning Trees in Weakly Dynamic Graphs

In this paper, we study weakly dynamic undirected graphs, that can be us...

Problems hard for treewidth but easy for stable gonality

We show that some natural problems that are XNLP-hard (which implies W[t...

Constructing Tree Decompositions of Graphs with Bounded Gonality

In this paper, we give a constructive proof of the fact that the treewid...

The Hierarchy of Stable Distributions and Operators to Trade Off Stability and Performance

Recent work addressing model reliability and generalization has resulted...

Default Logic and Bounded Treewidth

In this paper, we study Reiter's propositional default logic when the tr...

The mixed search game against an agile and visible fugitive is monotone

We consider the mixed search game against an agile and visible fugitive....
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.