The following pages link to (Q3309631):
Displaying 45 items.
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Successive partition of edges of bipartite graph into matchings (Q502001) (← links)
- On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs (Q556891) (← links)
- Evolutionary synthesis of low-sensitivity digital filters using adjacency matrix (Q632240) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture (Q644918) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- The clique-partitioning problem (Q807637) (← links)
- Modelling fuzzy universal resource identifiers: a first approach (Q815421) (← links)
- Heisenberg-integrable spin systems (Q835694) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- An approach to improving the Mayeda method for graph realization from a matrix (Q941170) (← links)
- Conditions for weak ergodicity of inhomogeneous Markov chains (Q956398) (← links)
- Low-energy excitations in the three-dimensional random-field Ising model (Q978939) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- The mathematical foundations of bond graphs. I: Algebraic theory (Q1119667) (← links)
- Cycles and spanning trees (Q1179106) (← links)
- Games with permission structures: The conjunctive approach (Q1185765) (← links)
- Statistical theory for the ratio model of paired comparisons (Q1206417) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Repeated games with \(M\)-period bounded memory (pure strategies) (Q1300377) (← links)
- The maximum clique problem (Q1318271) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- Circularity of the numerical range (Q1330002) (← links)
- Closed iterative calculus (Q1351472) (← links)
- Unicursal resistive networks (Q1363390) (← links)
- The bases of weighted graphs (Q1377737) (← links)
- Object-based image labeling through learning by example and multi-level segmentation (Q1402714) (← links)
- On extendibility of voltage and current regimes from subnetworks (Q1582070) (← links)
- Clustering: a neural network approach (Q1784538) (← links)
- Cut technique in valued relational systems: Mainsprings and applications (Q1920318) (← links)
- Crises and chaotic transients studied by the generalized cell mapping digraph method (Q1967021) (← links)
- Block structure and stability of the genetic code (Q2177184) (← links)
- Genetic code from tRNA point of view (Q2201978) (← links)
- Competitive location and pricing on networks with random utilities (Q2357929) (← links)
- The Boolean pivot operation, \(M\)-matrices, and reducible matrices (Q2365720) (← links)
- Competitive location on a network (Q2367390) (← links)
- Dominator sequences in bipartite graphs (Q2404078) (← links)
- The reduction of binary fuzzy relations and its applications (Q2466112) (← links)
- Graph theoretical duality perspective on conjugate structures and its applications (Q2574997) (← links)
- The mathematical foundations of bond graphs. II: Duality (Q2639873) (← links)
- The mathematical foundations of bond graphs. III: Matroid theory (Q2639874) (← links)
- Adjoint nullator‐norator networks (Q4849279) (← links)
- Superperfect pairs of trees in graphs (Q5285745) (← links)
