The following pages link to (Q4003439):
Displayed 37 items.
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm (Q293259) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- 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)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← 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)
- Towards the bi-directional cellular automaton model with perception ranges (Q1673009) (← 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)
- A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models (Q1952170) (← links)
- Eccentricity of networks with structural constraints (Q2194537) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Flanders' theorem for many matrices under commutativity assumptions (Q2438476) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Pfaffian orientations and perfect matchings of scale-free networks (Q2514127) (← links)
- Polynomial solvability of cost-based abduction (Q2676566) (← links)
- (Q4488859) (← links)
- On the computational complexity of ordered subgraph recognition (Q4851929) (← links)
- Cluster fault-tolerant routing in star graphs (Q4944745) (← links)
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)
- On-line graph algorithms for incremental compilation (Q6184394) (← links)