Pages that link to "Item:Q1103639"
From MaRDI portal
The following pages link to Constructing a perfect matching is in random NC (Q1103639):
Displayed 37 items.
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- The complexity of parallel search (Q1106664) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- A remark on maximum matching of line graphs (Q1377734) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp (Q2571820) (← links)
- Singular spaces of matrices and their application in combinatorics (Q4005434) (← links)
- Threshold Functions for <i>H</i>-factors (Q4290084) (← links)
- (Q4536416) (← links)
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273) (← links)
- PARALLEL APPROXIMATE MATCHING (Q4819985) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) (← links)