The following pages link to (Q3684121):
Displaying 50 items.
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- Modelling deadlock in open restricted queueing networks (Q1754125) (← links)
- Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- Local base station assignment with time intervals in mobile computing environments (Q1877045) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author (Q1889973) (← links)
- Multigraph representations of hierarchical loglinear models (Q1918460) (← links)
- An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses (Q1944108) (← links)
- Optimal path cover problem on block graphs (Q1960660) (← links)
- Fuzzy decision networks and deconvolution (Q1963060) (← links)
- Tropical compound matrix identities (Q2002815) (← links)
- Euler's Königsberg: the explanatory power of mathematics (Q2289705) (← links)
- A multi-time-scale analysis of chemical reaction networks. I: Deterministic systems (Q2340017) (← links)
- On the zero divisor graphs of the ring of Lipschitz integers modulo \(n\) (Q2361381) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Using a minimal number of resets when testing from a finite state machine (Q2390268) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square (Q2476785) (← links)
- Decomposing toroidal graphs into circuits and edges (Q2486748) (← links)
- A model search procedure for hierarchical models (Q2563651) (← links)
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. (Q2583551) (← links)
- Dispersal routes reconstruction and the minimum cost arborescence problem (Q2632050) (← links)
- A two-step communication opinion dynamics model with self-persistence and influence index for social networks based on the DeGroot model (Q2660963) (← links)
- A Category-Theoretic Approach to Social Network Analysis (Q2841255) (← links)
- Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them (Q2917207) (← links)
- Automatized Search for Complex Symbolic Dynamics with Applications in the Analysis of a Simple Memristor Circuit (Q2930508) (← links)
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)
- Developing a mathematical model for bobbin lace (Q3453875) (← links)
- A NOTE ON FRACTALS OF ONE FORBIDDEN WORD AND THEIR BOX DIMENSIONS (Q3510234) (← links)
- AN AVERAGING PRINCIPLE FOR COMBINED INTERACTION GRAPHS — CONNECTIVITY AND APPLICATIONS TO GENETIC SWITCHES (Q3585113) (← links)
- An Event-Driven Algorithm for Agents on the Web (Q3627855) (← links)
- Perfect pairs of trees in graphs (Q3991117) (← links)
- Application of a neural network to a design optimization process (Q4034402) (← links)
- Different local controls for graph relabeling systems (Q4327379) (← links)
- Evaluating efficiency of self-reconfiguration in a class of modular robots (Q4348624) (← links)
- Feature-based operation sequence generation in CAPP (Q4398893) (← links)
- Algebraic multigrid methods (Q4594246) (← links)
- Network topology of the interbank market (Q4610278) (← links)
- Problems on pairs of trees and the four colour problem of planar graphs (Q4630251) (← links)
- Modelling and analysis of distributed program execution in BETA using coloured Petri Nets (Q4633166) (← links)
- An algebraic multilevel method for anisotropic elliptic equations based on subgraph matching (Q4921810) (← links)
- On the performance and feasibility of multicast core selection heuristics (Q4953324) (← links)
- ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH (Q4963120) (← links)
- Modulation in tetradic harmony and its role in jazz (Q4993916) (← links)
- Criteria for a Structure to be Mesoionic (Q5050747) (← links)
- A Method for Computation and Analysis of Partial Synchronization Manifolds of Delay Coupled Systems (Q5054568) (← links)
- Alternating Cell Direction Implicit Method Using Approximate Factorization on Hybrid Grids (Q5077109) (← links)
- Planarity and Genus of Sparse Random Bipartite Graphs (Q5084098) (← links)
- Edge local complementation for logical cluster states (Q5135863) (← links)
