The following pages link to (Q3732972):
Displaying 21 items.
- On the determinant of bipartite graphs (Q389461) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← 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)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Finding a maximum matching in a circular-arc graph (Q1209984) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- A simple nc algorithm to recognize weakly triangulated graphs (Q4729374) (← links)
- SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141) (← links)
- (Q4993356) (← links)
