The following pages link to (Q5581642):
Displaying 50 items.
- Fuzzy colouring of fuzzy graphs (Q258334) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- The generalized logit-linear item response model for binary-designed items (Q477952) (← links)
- Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design (Q506713) (← links)
- Non-admissible tracks in Shamirs scheme (Q549265) (← links)
- Generating functions for mechanism specialization (Q553591) (← links)
- The cardinality of the collection of maximum independent sets of a functional graph (Q678609) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- Static behavior analysis of a mesh system (Q688440) (← links)
- Enumeration of connected graphs with cut vertices (Q698029) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Construction of defining relators for finite groups (Q759098) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- Multidisk file design: An analysis of folding buckets to disks (Q797303) (← links)
- Coping with known patterns of lies in a search game (Q797505) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- An efficient and flexible algorithm for online mining of large itemsets (Q834974) (← links)
- Micromechanical definition of an entropy for quasi-static deformation of granular materials (Q835882) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- The necessary and sufficient condition for the worst-case male optimal stable matching (Q915462) (← links)
- A procedure to count the number of planar mechanisms subject to design constraints from kinematic chains (Q925795) (← links)
- Large deviations for symmetrised empirical measures (Q927254) (← links)
- Symbolic derivation of order conditions for hybrid Numerov-type methods solving \(y^{\prime\prime} =f(x,y)\) (Q932743) (← links)
- On the distribution of runs of ones in binary strings (Q979847) (← links)
- Simulation-based optimization for discharge/loading operations at a maritime container terminal (Q989637) (← links)
- Symbolic derivation of Runge-Kutta-Nyström order conditions (Q1037494) (← links)
- A probabilistic PDL (Q1063584) (← links)
- Generating and counting valid patterns in routes between two points (Q1080436) (← links)
- On some counting polynomials in chemistry (Q1095908) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- Computationally efficient bounds for the Catalan numbers (Q1097279) (← links)
- Genus distributions for two classes of graphs (Q1118607) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- Classification of \(P_{k2}\) (Q1121299) (← links)
- Inductive reasoning on recursive equations (Q1136246) (← links)
- Complement total unimodularity (Q1143465) (← links)
- The representation of posets and lattices by sets (Q1147172) (← links)
- The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
- On two theorems of Lenstra (Q1149470) (← links)
- An expression for the number of equivalence classes of Latin squares under row and column permutations (Q1156805) (← links)
- Representation of graphs (Q1157966) (← links)
- Compositional complexity of Boolean functions (Q1162360) (← links)
- Une approche combinatoire des fonctions elliptiques de Jacobi (Q1163138) (← links)
- Complexity of finding k-path-free dominating sets in graphs (Q1167535) (← links)
- R-domination of block graphs (Q1171499) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Fault-detection in networks (Q1199624) (← links)
- On enumerating paths of K arcs in unoriented complete graphs (Q1219305) (← links)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
- An introduction to matching polynomials (Q1229232) (← links)
