Path-contractions, edge deletions and connectivity preservation
From MaRDI portal
(Redirected from Publication:5111736)
Path-contractions, edge deletions and connectivity preservation (scientific article; zbMATH DE number 7205025)
Path-contractions, edge deletions and connectivity preservation (scientific article; zbMATH DE number 7205025)
Recommendations
Cites work
- An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting undirected node-connectivity by one
- Connections in combinatorial optimization
- Edge-connectivity augmentation problems
- Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- Kernelization and complexity results for connectivity augmentation problems
- Minimal edge-coverings of pairs of sets
- Parameterized algorithms
- Parameterized algorithms to preserve connectivity
- Recent developments in kernelization: a survey
- Representative sets and irrelevant vertices: new tools for kernelization
- Subexponential algorithms for rectilinear Steiner tree and arborescence problems
- The minimum spanning strong subdigraph problem is fixed parameter tractable
Cited in
(2)
This page was built for publication: Path-contractions, edge deletions and connectivity preservation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111736)
