2 citations · 3 across the 8 of their papers we have counts for
5 papers · 1 filter
Optimal Padded Decomposition For Bounded Treewidth Graphs
Arnold Filtser, Tobias Friedrich, Davis Issac +4
A -padded decomposition of an edge-weighted graph is a stochastic decomposition into clusters of diameter at most such that for every vertex , th…
Combining Crown Structures for Vulnerability Measures
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits +2
Over the past decades, various metrics have emerged in graph theory to grasp the complex nature of network vulnerability. In this paper, we study two specific measures: (weighted)…
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
Tobias Friedrich, Davis Issac, Nikhil Kumar +2
We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth- graph, there exists a (fraction…
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
Katrin Casel, Tobias Friedrich, Davis Issac +2
In the 1970s, Győri and Lovász showed that for a -connected -vertex graph, a given set of terminal vertices and natural numbers satisfying…
Balanced Crown Decomposition for Connectivity Constraints
Katrin Casel, Tobias Friedrich, Davis Issac +2
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular model…