The following pages link to Shaohan Ma (Q208311):
Displayed 43 items.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- A practical algorithm for the minimum rectilinear Steiner tree (Q1966510) (← links)
- (Q2720046) (← links)
- (Q2720047) (← links)
- (Q2765156) (← links)
- (Q3035328) (← links)
- Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems (Q3087938) (← links)
- (Q3203054) (← links)
- (Q3361926) (← links)
- Complexity and Improved Heuristic Algorithms for Binary Fingerprints Clustering (Q3406337) (← links)
- (Q3491618) (← links)
- (Q3728821) (← links)
- (Q3730028) (← links)
- (Q3771969) (← links)
- (Q3772250) (← links)
- (Q3773908) (← links)
- (Q3781123) (← links)
- (Q3812268) (← links)
- (Q3835485) (← links)
- (Q3944520) (← links)
- (Q3949057) (← links)
- (Q3974827) (← links)
- (Q4000686) (← links)
- (Q4203007) (← links)
- (Q4203043) (← links)
- New bounds on time and number of processors for multiprocessor optimal schedules (Q4229565) (← links)
- A practical parallel algorithm for propositional knowledge base revision (Q4229567) (← links)
- (Q4278912) (← links)
- (Q4290436) (← links)
- (Q4300481) (← links)
- (Q4483822) (← links)
- (Q4525693) (← links)
- (Q4525697) (← links)
- (Q4675629) (← links)
- (Q4696797) (← links)
- (Q4726289) (← links)
- (Q4734765) (← links)
- Efficient mining of association rules by reducing the number of passes over the database (Q5945844) (← links)
- Hardness and methods to solve CLIQUE (Q5959359) (← links)