Pages that link to "Item:Q1898731"
From MaRDI portal
The following pages link to Minimal edge-coverings of pairs of sets (Q1898731):
Displaying 47 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Combinatorial algorithms for matchings, even factors and square-free 2-factors (Q877189) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Covering symmetric supermodular functions by graphs (Q1300054) (← links)
- Finding minimum generators of path systems (Q1305531) (← links)
- A note on the vertex-connectivity augmentation problem (Q1386437) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- Restricted \(t\)-matchings in bipartite graphs (Q1410687) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Balanced minimum covers of a finite set (Q2461211) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- Extremal graphs in connectivity augmentation (Q4256090) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- How to make a strongly connected digraph two-connected (Q5101433) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- Strongly connectable digraphs and non-transitive dice (Q5154618) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations (Q6093584) (← links)
- Making a tournament k $k$‐strong (Q6094049) (← links)