The following pages link to (Q4003439):
Displayed 20 items.
- A systolic algorithm for solving dense linear systems (Q679296) (← links)
- A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488) (← links)
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages (Q707005) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Shape analysis for automated sulcal classification and parcellation of MRI data (Q927176) (← links)
- The capacity of monotonic functions (Q1265747) (← links)
- The maximum clique problem (Q1318271) (← links)
- A systolic algorithm for dynamic programming (Q1324387) (← links)
- Node-to-node cluster fault tolerant routing in star graphs (Q1350230) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Directed graphs and Lie superalgebras of matrices (Q1770462) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Distributed probabilistic polling and applications to proportionate agreement (Q1854483) (← links)
- An improved genetic algorithm for facility layout problems having inner structure walls and passages (Q1869891) (← links)
- Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- (Q4488859) (← links)
- On the computational complexity of ordered subgraph recognition (Q4851929) (← links)
- (Q4944745) (← links)