Augmentation Problems - MaRDI portal

Cited In (92)

An algorithm to increase the node-connectivity of a digraph by one
Augmenting the connectivity of planar and geometric graphs
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
Smallest bipartite bridge-connectivity augmentation
A subclass of Horn CNFs optimally compressible in polynomial time
A unified framework for bi(tri)connectivity and chordal augmentation
Vertex covering by paths on trees with its applications in machine translation
Evolutionary local search for the edge-biconnectivity augmentation problem
A minimum 3-connectivity augmentation of a graph
An approximation algorithm for minimum-cost vertex-connectivity problems
Extension to Even Triangulations
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Increasing digraph arc-connectivity by arc addition, reversal and complement
The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
How to allocate review tasks for robust ranking
Faster approximation algorithms for weighted triconnectivity augmentation problems
Triangulating planar graphs while minimizing the maximum degree
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
The bridge-connectivity augmentation problem with a partition constraint
Kernelization and complexity results for connectivity augmentation problems
Communication complexity of fault-tolerant information diffusion
Sparse graphs and an augmentation problem
Sparse graphs and an augmentation problem
A linear time algorithm for computing 3-edge-connected components in a multigraph
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Structured connectivity augmentation
Structured connectivity augmentation
An 0(log n) parallel algorithm for strong connectivity augmentation problem
Conditions for graphs to be path partition optimal
Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
Geometric biplane graphs. II: Graph augmentation
Augmenting edge-connectivity between vertex subsets
Minimum-weight two-connected spanning networks
A survey of parameterized algorithms and the complexity of edge modification
On the minor-minimal 2-connected graphs having a fixed minor
Independence free graphs and vertex connectivity augmentation
A smallest augmentation to 3-connect a graph
Precedence-constrained arborescences
On mapping processes to processors in distributed systems
Regular augmentation of planar graphs
Tri-connectivity augmentation in trees
On triangulating planar graphs under the four-connectivity constraint
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Determination of social laws for multi-agent mobilization
Graph connectivity and its augmentation: Applications of MA orderings
Triangulating planar graphs while minimizing the maximum degree
Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
A Survey on Covering Supermodular Functions
Robustness and strong attack tolerance of low-diameter networks
Augmenting the connectivity of geometric graphs
Approximation algorithms for graph augmentation
Edge-connectivity augmentation problems
On the relationship between the biconnectivity augmentation and traveling salesman problems
A polyhedral approach to planar augmentation and related problems
Augmenting forests to meet odd diameter requirements
On the fixed-parameter tractability of the maximum connectivity improvement problem
Two fixed-parameter algorithms for vertex covering by paths on trees
Augmenting the edge connectivity of planar straight line graphs to three
Connectivity augmentation in planar straight line graphs
On triconnected and cubic plane graphs on given point sets
Augmenting the connectivity of outerplanar graphs
Better algorithms for minimum weight vertex-connectivity problems
Edge-connectivity augmentations of~graphs~and~hypergraphs
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
An analogue of Hoffman's circulation conditions for max-balanced flows
Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
Globally rigid augmentation of rigid graphs
Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach
How to Secure Matchings Against Edge Failures
How to Secure Matchings against Edge Failures
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks
Strongly connectable digraphs and non-transitive dice
How to make a strongly connected digraph two-connected
Strongly connected spanning subgraph for almost symmetric networks
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
Network augmentation for disaster‐resilience against geographically correlated failure
A genetic approach for the 2‐edge‐connected minimum branch vertices problem
Bounded length, 2-edge augmentation of geometric planar graphs
Two-page book embedding of trees under vertex-neighborhood constraints
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
Plane augmentation of plane graphs to meet parity constraints
Optimal augmentation for bipartite componentwise biconnectivity in linear time
Making bipartite graphs DM-irreducible
A PTAS for three-edge-connected survivable network design in planar graphs
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
Making bidirected graphs strongly connected
Supermodularity in unweighted graph optimization. I: Branchings and matchings
Augmenting trees so that every three vertices lie on a cycle
Extending simple drawings
Minimizing Coordination Channels in Distributed Testing
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas

This page was built for publication: Augmentation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4115167)