The following pages link to Augmentation Problems (Q4115167):
Displaying 50 items.
- Tri-connectivity augmentation in trees (Q327625) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- Edge-connectivity augmentation problems (Q1091147) (← links)
- On mapping processes to processors in distributed systems (Q1095652) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- Determination of social laws for multi-agent mobilization (Q1389600) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- Conditions for graphs to be path partition optimal (Q1709536) (← links)
- Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas (Q1721436) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach (Q1793597) (← links)
- An analogue of Hoffman's circulation conditions for max-balanced flows (Q1802959) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- On the minor-minimal 2-connected graphs having a fixed minor (Q1827674) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Sparse graphs and an augmentation problem (Q2118121) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Extending simple drawings (Q2206853) (← links)
- Making bidirected graphs strongly connected (Q2300723) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
