Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Jungeblut, Paul"'
We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connected planar cubic graphs, both in the variable and fixed embedding sett
Externí odkaz:
http://arxiv.org/abs/2401.05892
Autor:
Jungeblut, Paul
In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn as circular arcs connecting their respective endpoints. Additionally, all vertices have perfect angular resolution, i.e., all angles incident to a vertex $v$ ha
Externí odkaz:
http://arxiv.org/abs/2306.02649
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling a number of cops and the other controlling a robber, take alternating turns. In a turn, each player
Externí odkaz:
http://arxiv.org/abs/2302.10577
A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial inequalities
Externí odkaz:
http://arxiv.org/abs/2301.05550
Publikováno v:
Computing in Geometry and Topology, 3(2), 4:1-4:12 (2024)
Cops and Robber is a family of two-player games played on graphs in which one player controls a number of cops and the other player controls a robber. In alternating turns, each player moves (all) their figures. The cops try to capture the robber whi
Externí odkaz:
http://arxiv.org/abs/2301.05514
Publikováno v:
A preliminary version of this paper is published in the proceedings of the 64th Annual Symposium on Foundations of Computer Science (FOCS 2023)
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topologica
Externí odkaz:
http://arxiv.org/abs/2211.04732
It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs, and hence
Externí odkaz:
http://arxiv.org/abs/2204.11750
We consider the problem of finding weights and biases for a two-layer fully connected neural network to fit a given set of data points as well as possible, also known as EmpiricalRiskMinimization. Our main result is that the associated decision probl
Externí odkaz:
http://arxiv.org/abs/2204.01368
A squaregraph is a plane graph in which each internal face is a $4$-cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semi-strong product of an outerplanar graph and a pa
Externí odkaz:
http://arxiv.org/abs/2203.03772
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexi
Externí odkaz:
http://arxiv.org/abs/2112.04343