7 citations · 19 across the 9 of their papers we have counts for
4 papers · 1 filter
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
The stack number of a directed acyclic graph is the minimum for which there is a topological ordering of and a -coloring of the edges such that no two edges of the s…
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
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 pl…
Training Fully Connected Neural Networks is -Complete
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut +2
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 EmpiricalR…
The product structure of squaregraphs
Robert Hickingbotham, Paul Jungeblut, Laura Merker +1
A squaregraph is a plane graph in which each internal face is a -cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to…