Pages that link to "Item:Q4837644"
From MaRDI portal
The following pages link to Preserving and Increasing Local Edge-Connectivity in Mixed Graphs (Q4837644):
Displaying 22 items.
- On packing arborescences in temporal networks (Q477677) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Covering skew-supermodular functions by hypergraphs of minimum total size (Q1038104) (← links)
- Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- A New Approach to Splitting-Off (Q3503862) (← links)
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs (Q3794218) (← links)
- A note on mixed graphs and directed splitting off (Q4242949) (← links)
- Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
- (Q5158499) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)