Pages that link to "Item:Q1095658"
From MaRDI portal
The following pages link to Matching is as easy as matrix inversion (Q1095658):
Displayed 50 items.
- Independent sets versus perfect matchings (Q673116) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← 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)
- Nonlinear bipartite matching (Q924630) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← 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)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← 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)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
- Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
- Graph-theoretic techniques in D-optimal design problems (Q1598699) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)