4 papers
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
Arne Leitert
We investigate the two problems of computing the union join graph as well as computing the subset graph for acyclic hypergraphs and their subclasses. In the union join graph of…
Injective hulls of various graph classes
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, ther…
Equivalence between pathbreadth and strong pathbreadth
Guillaume Ducoffe, Arne Leitert
We say that a given graph has \emph{pathbreadth} at most , denoted $\pb(G) \leq ρ$, if there exists a Roberston and Seymour's path decomposition where every bag is…
Parameterized Approximation Algorithms for some Location Problems in Graphs
Arne Leitert, Feodor F. Dragan
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) -Domination problem and the (Connected) -Center problem for unweighted a…