# Complexity and Algorithms in Graphs

**Type:** Topics  
**Canonical URL:** https://scholariq.org/topics/complexity-and-algorithms-in-graphs/

## Facts

| Field | Value |
| --- | --- |
| Description | This cluster of papers focuses on combinatorial optimization, approximation algorithms, complexity theory, graph algorithms, submodular functions, network flows, matrix multiplication, communication complexity, linear programming, and algorithmic applications. |
| Domain | Physical Sciences |
| Field | Computer Science |
| OpenAlex ID | t10720 |
| Works | 14 |

## Topic papers all

- [Nonconstructive tools for proving polynomial-time decidability](https://scholariq.org/papers/nonconstructive-tools-for-proving-polynomial-time-decidability/)
- [Iterative Methods in Combinatorial Optimization](https://scholariq.org/papers/iterative-methods-in-combinatorial-optimization/)
- [A Randomized Rounding Approach to the Traveling Salesman Problem](https://scholariq.org/papers/a-randomized-rounding-approach-to-the-traveling-salesman-problem/)
- [Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.](https://scholariq.org/papers/kernelization-algorithms-for-the-vertex-cover-problem-theory-and-experiments/)
- [Approximating minimum bounded degree spanning trees to within one of optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal-2/)
- [Crown Structures for Vertex Cover Kernelization](https://scholariq.org/papers/crown-structures-for-vertex-cover-kernelization/)
- [Survivable Network Design with Degree or Order Constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints-2/)
- [Survivable network design with degree or order constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints/)
- [Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs](https://scholariq.org/papers/improved-approximation-ratios-for-traveling-salesperson-tours-and-paths-in/)
- [Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal/)
- [Ore’s condition for completely independent spanning trees](https://scholariq.org/papers/ore-s-condition-for-completely-independent-spanning-trees/)
- [Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings](https://scholariq.org/papers/efficient-information-theoretic-secure-multiparty-computation-over-mathbb-z-p-k/)
- [The C3-structure of the tournaments](https://scholariq.org/papers/the-c3-structure-of-the-tournaments/)
- [Online Disjoint Set Cover Without Prior Knowledge](https://scholariq.org/papers/online-disjoint-set-cover-without-prior-knowledge/)

## Topic primary papers

- [A Randomized Rounding Approach to the Traveling Salesman Problem](https://scholariq.org/papers/a-randomized-rounding-approach-to-the-traveling-salesman-problem/)
- [Approximating minimum bounded degree spanning trees to within one of optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal-2/)
- [Crown Structures for Vertex Cover Kernelization](https://scholariq.org/papers/crown-structures-for-vertex-cover-kernelization/)
- [Survivable Network Design with Degree or Order Constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints-2/)
- [Survivable network design with degree or order constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints/)
- [Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.