Augmentation Problems - MaRDI portal

Cited in

(92)

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

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)