arXiv (All)
open access
A Polymatroidal Perspective on Random Contraction
Karger's elegant random contraction algorithm for finding a global mincut in a graph has been highly influential. More recent work has obtained several different (nonuniform) random contraction algorithms for mincut in hypergraphs and hedgegraphs. Motivated by the conceptual goal of understanding th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Extensions of Multidirected Graphs: Fuzzy, Neutrosophic, Plithogenic, Rough, Soft, Hypergraph, and Superhypergraph Variants#718677
- Coordinating Pebble Motion on Graphs, The Diameter of Permutation Groups, and Applications#472203
- Merge Trees of Length-Filtered Lattice Knot Spaces#1155214
- Finding all sorting tandem duplication random loss operations#622711
Record · ID 927805
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive