Results 61 to 70 of about 39,392 (275)

Extremal Optimization of Graph Partitioning at the Percolation Threshold

, 1999
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called Extremal Optimization, is compared to Simulated Annealing in extensive ...
Balberg I, Banavar J R, Boettcher S, Boettcher S, Cerny V, Cheeseman P, Erdös P, For those issues see, Fu Y T, Garey M R, Gould S J, H Frauenfelder, Houdayer J, Janson S, Johnson D S, Kirkpatrick S, Mezard M, Mezard M, Sorkin G B, Stauffer D, Stefan Boettcher, Toulouse G, Wong K Y M, Wong K Y M, Wong K Y M   +24 more
core   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

Advanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur, Faruk Kaya, Bora Derin, Mustafa Lütfi Öveçoğlu, Ju Li, Duygu Ağaoğulları   +5 more
wiley   +1 more source

Extremal Matching Energy of Random Polyomino Chains

Entropy, 2017
Polyomino graphs is one of the research objectives in statistical physics and in modeling problems of surface chemistry. A random polyomino chain is a subgraph of a polyomino graph.
Tingzeng Wu, Huazhong Lü, Xuexin Zhang
doaj   +1 more source

The Clique Density Theorem

, 2016
Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent ...
Reiher, Christian
core   +1 more source

Extremal graphs for α- index

Revista Integración, 2020
Revista Integración, temas de ...
Eber Lenes, Henry García, Ariel Figueroa, Fabian Mercado   +3 more
openaire   +2 more sources

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

Advanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice, Krzysztof S. Stopka, Michael D. Sangid   +2 more
wiley   +1 more source

Breaking Symmetries in Graph Representation [PDF]

, 2013
There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution.
Codish, M., Miller, A., Prosser, P., Stuckey, A.   +3 more
core  

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

Advanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora, Tales V. Lisbôa, Axel Spickenheuer, Rogério J. Marczak, Jakson M. Vassoler   +4 more
wiley   +1 more source

Further results on permanents of Laplacian matrices of trees

Open Mathematics
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj   +1 more source

On the KG-Sombor index

Vojnotehnički Glasnik
Introduction/purpose: Degree-based graph invariants are a type of molecular descriptor that represent the connectivity of atoms (vertices) in a molecule through bonds (edges). They are used to model structural properties of molecules and provide valuable
Ochirbat Altangoo, Dechinpuntsag Bolormaa, Badarch Gantuya, Tsend-Ayush Selenge   +3 more
doaj   +1 more source