Pages that link to "Item:Q1892220"

The following pages link to A matroid approach to finding edge connectivity and packing arborescences (Q1892220):

Displaying 35 items.

• A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems (Q293142) (← links)
• Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
• Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• A binomial approximation method for the Ising model (Q741352) (← links)
• An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
• Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
• Sparsity-certifying graph decompositions (Q1043807) (← links)
• Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
• Simple planar graph partition into three forests (Q1392570) (← links)
• Disjoint paths in arborescences (Q1773369) (← links)
• Approximation algorithms for aligning points (Q1879366) (← links)
• Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
• Compact cactus representations of all non-trivial min-cuts (Q1983141) (← links)
• A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
• Reachability in arborescence packings (Q2166224) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
• Orientations and detachments of graphs with prescribed degrees and connectivity (Q2339815) (← links)
• Relay placement for two-connectivity (Q2339829) (← links)
• Optimal per-edge processing times in the semi-streaming model (Q2380006) (← links)
• Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566) (← links)
• An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
• Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
• Minimum Cuts of Simple Graphs in Almost Always Linear Time (Q3605499) (← links)
• The Minimum Weight In-Tree Cover Problem (Q3627688) (← links)
• Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
• (Q5075827) (← links)
• (Q5158499) (← links)
• Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
• Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
• Minimum cut in \(O(m \log^2 n)\) time (Q6614613) (← links)