The following pages link to Graph theory applications (Q1189421):
Displaying 32 items.
- An improved two-stage optimization-based framework for unequal-areas facility layout (Q331972) (← links)
- Turning restriction design in traffic networks with a budget constraint (Q486412) (← links)
- The power graph on the conjugacy classes of a finite group (Q519947) (← links)
- Dynamical properties of electrical circuits with fully nonlinear memristors (Q660774) (← links)
- Does contraction preserve triangular meshes? (Q676930) (← links)
- Cyclic matrices of weighted digraphs (Q765371) (← links)
- A geometric Birkhoffian formalism for nonlinear RLC networks (Q857409) (← links)
- A central limit theorem and higher order results for the angular bispectrum (Q929371) (← links)
- Augmented nodal matrices and normal trees (Q968112) (← links)
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638) (← links)
- A computational method for determining strong stabilizability of \(n\)-D systems (Q1300577) (← links)
- An algorithm for computing the stable coalition structures in tree-graph communication games (Q1304775) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Characterizing the scale dimension of a high-dimensional classification problem (Q1856632) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint (Q1921328) (← links)
- Lucas graphs (Q2053124) (← links)
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances (Q2108111) (← links)
- Clique-partitioned graphs (Q2127629) (← links)
- A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
- Almost complete and equable heteroclinic networks (Q2303756) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- High-resolution asymptotics for the angular bispectrum of spherical random fields (Q2493544) (← links)
- On the subgroup structure of the hyperoctahedral group in six dimensions (Q2808949) (← links)
- The tractability index of memristive circuits: branch-oriented and tree-based models (Q2919479) (← links)
- The hyperbolicity problem in electrical circuit theory (Q3061205) (← links)
- Closing ranks in rigid multi-agent formations using edge contraction (Q3075945) (← links)
- Asymptotic stability of robust heteroclinic networks (Q5112208) (← links)
- Semistate models of electrical circuits including memristors (Q5298740) (← links)
- Bounds on the Steiner radius of a graph (Q6059079) (← links)
- Graph theory approach to exceptional points in wave scattering (Q6159714) (← links)
