The following pages link to Gen-Huey Chen (Q198402):
Displayed 50 items.
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model (Q582123) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Data mapping of linear programming on fixed-size hypercubes (Q751769) (← links)
- A simple approach to implementing multiplication with small tables (Q751796) (← links)
- A note on optimal multiway split trees (Q802863) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Constant time sorting on a processor array with a reconfigurable bus system (Q915452) (← links)
- Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model (Q916359) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Finding cycles in hierarchical hypercube networks (Q975541) (← links)
- Fault-free longest paths in star networks with conditional link faults (Q1006049) (← links)
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model (Q1007887) (← links)
- An algorithm paradigm for incomplete hypercubes (Q1178545) (← links)
- An improved parallel algorithm for 0/1 knapsack problem (Q1195150) (← links)
- Distributed algorithms for the quickest path problem (Q1195152) (← links)
- Conflict-free broadcasting algorithms for graph traversals and their applications (Q1195181) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- On the complexity of generating synchronizable test sequences (Q1203646) (← links)
- On the quickest path problem (Q1261485) (← links)
- An algorithm for coalescing operations with precedence constraints in real-time systems (Q1261486) (← links)
- Pipeline architectures for dynamic programming algorithms (Q1263945) (← links)
- Selection of the first k largest processes in hypercubes (Q1263960) (← links)
- An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (Q1268797) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Broadcasting on incomplete WK-recursive networks (Q1306099) (← links)
- Sorting and computing convex hulls on processor arrays with reconfigurable bus systems (Q1310923) (← links)
- The Steiner problem in distributed computing systems (Q1310949) (← links)
- Deriving algorithms on reconfigurable networks based on function decomposition (Q1314369) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths (Q1318506) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Multiple search problem on reconfigurable meshes (Q1350197) (← links)
- Combinatorial properties of generalized hypercube graphs (Q1350759) (← links)
- Node-disjoint paths in incomplete WK-recursive networks (Q1583385) (← links)
- Hamiltonicity of the hierarchical cubic network (Q1597762) (← links)
- A note on cyclic-cubes (Q1607011) (← links)
- Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures (Q1870561) (← links)
- Generalized diameters of the mesh of trees (Q1882537) (← links)
- Cost-optimal parallel algorithms for constructing B-trees (Q1894244) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- The broadcast median problem in heterogeneous postal model (Q1956241) (← links)
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model (Q2378525) (← links)
- Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
- Strong Rabin numbers of folded hypercubes (Q2566009) (← links)
- Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908) (← links)
- Minimum spanners of butterfly graphs (Q2719847) (← links)
- Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns (Q2784464) (← links)
- Optimal buy-and-hold strategies for financial markets with bounded daily returns (Q2819540) (← links)