Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Mühlenthaler, Moritz"'
Given a graph $G$ and two graph homomorphisms $\alpha$ and $\beta$ from $G$ to a fixed graph $H$, the problem $H$-Recoloring asks whether there is a transformation from $\alpha$ to $\beta$ that changes the image of a single vertex at each step and ke
Externí odkaz:
http://arxiv.org/abs/2410.12687
The problem \textsc{Token Jumping} asks whether, given a graph $G$ and two independent sets of \emph{tokens} $I$ and $J$ of $G$, we can transform $I$ into $J$ by changing the position of a single token in each step and having an independent set of to
Externí odkaz:
http://arxiv.org/abs/2408.04743
Given a graph $G$ and two independent sets of $G$, the independent set reconfiguration problem asks whether one independent set can be transformed into the other by moving a single vertex at a time, such that at each intermediate step we have an inde
Externí odkaz:
http://arxiv.org/abs/2402.03063
The orientation theorem of Nash-Williams states that an undirected graph admits a $k$-arc-connected orientation if and only if it is $2k$-edge-connected. Recently, Ito et al. showed that any orientation of an undirected $2k$-edge-connected graph can
Externí odkaz:
http://arxiv.org/abs/2304.14868
For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms from a graph G to H, we can transform one into the other by changing the image of a single vertex of G in each step and maintaining a homomorphism from G to H thro
Externí odkaz:
http://arxiv.org/abs/2205.09210
An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a $(1 - f(\epsilon))$-fraction of the constraints on any $(1-\epsilon)$-satisfiable instance, where the loss function $f$ is such
Externí odkaz:
http://arxiv.org/abs/2110.11851
Autor:
Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira
Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL captures \PSPACE\xspace and has been a useful tool for proving algorithmic hardness of man
Externí odkaz:
http://arxiv.org/abs/2011.10385
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform fault model. Such a model assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ may fail. While this approach
Externí odkaz:
http://arxiv.org/abs/2009.05382
Autor:
Bousquet, Nicolas, Hommelsheim, Felix, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira
Publikováno v:
In Theoretical Computer Science 10 November 2023 979
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tree augmentation problem (TAP)
Externí odkaz:
http://arxiv.org/abs/1910.13297