Pages that link to "Item:Q3543582"
From MaRDI portal
The following pages link to Algorithmic Aspects of Graph Connectivity (Q3543582):
Displaying 41 items.
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults (Q763544) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs (Q894472) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- Quantum graphs which optimize the spectral gap (Q1675054) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (Q1987237) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- A metric to compare vulnerability of the graphs of different sizes (Q2413408) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- On computing the connectivities of graphs and digraphs (Q3330525) (← links)
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- On the robustness to multiple agent losses in 2D and 3D formations (Q3458633) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- One-way trail orientations (Q5002671) (← links)
- Depth functions and mutidimensional medians on minimal spanning trees (Q5036984) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- (Q5091003) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions (Q5207235) (← links)
- The firebreak problem (Q6065343) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- The double-bubble problem on the square lattice (Q6123799) (← links)
- A classification method based on a cloud of spheres (Q6491344) (← links)
- A note on the connectivity of the exchanged hypercube (Q6542939) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)