Zobrazeno 1 - 10
of 129
pro vyhledávání: '"van der Wegen P"'
We show that some natural problems that are XNLP-hard (which implies W[t]-hardness for all t) when parameterized by pathwidth or treewidth, become FPT when parameterized by stable gonality, a novel graph parameter based on optimal maps from graphs to
Externí odkaz:
http://arxiv.org/abs/2202.06838
This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal divisorial
Externí odkaz:
http://arxiv.org/abs/2106.12568
In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on $m$ machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains. Each
Externí odkaz:
http://arxiv.org/abs/2007.09023
Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices. In the Rainbow Vertex
Externí odkaz:
http://arxiv.org/abs/2003.03108
Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial gonality of
Externí odkaz:
http://arxiv.org/abs/1808.06921
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 21 no. 1, ICGT 2018 (June 13, 2019) dmtcs:4931
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 nu
Externí odkaz:
http://arxiv.org/abs/1801.07553
Publikováno v:
Earth System Science Data, Vol 14, Pp 2445-2462 (2022)
Coastal mangroves, thriving at the interface between land and sea, provide robust flood risk reduction. Projected increases in the frequency and magnitude of climate impact drivers such as sea level rise and wind and wave climatology reinforce the ne
Externí odkaz:
https://doaj.org/article/a793fc6f4bf14867baf628c178f882d3
Recently, a new set of multigraph parameters was defined, called "gonalities". Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number theory and multigraph algorithms. Multigraphs of gonality 1 are trees
Externí odkaz:
http://arxiv.org/abs/1706.05670
There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree of a fini
Externí odkaz:
http://arxiv.org/abs/1504.06713
Autor:
V. Q. Thanh, D. Roelvink, M. van der Wegen, J. Reyns, H. Kernkamp, G. Van Vinh, V. T. P. Linh
Publikováno v:
Hydrology and Earth System Sciences, Vol 24, Pp 189-212 (2020)
Building high dykes is a common measure of coping with floods and plays an important role in agricultural management in the Vietnamese Mekong Delta. However, the construction of high dykes causes considerable changes in hydrodynamics of the Mekong Ri
Externí odkaz:
https://doaj.org/article/e6eccc4ecb2a45e08bd7257785b765e3