Pages that link to "Item:Q1103639"
From MaRDI portal
The following pages link to Constructing a perfect matching is in random NC (Q1103639):
Displaying 50 items.
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Approximating weighted matchings in parallel (Q845697) (← 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)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← 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)
- Matching is as easy as matrix inversion (Q1095658) (← 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)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← 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)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- A simple a. s. correct algorithm for deciding if a graph has a perfect matching (Q1902903) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- Almost exact matchings (Q2429356) (← 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)
- An NC algorithm for the perfect matching problem in larger cycle-free graphs (Q2741350) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
