Results 61 to 70 of about 38,199 (317)
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4
, 2009 A mapping from the vertex set of a graph G=(V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common ...
Noble, Steven +8 more
core +1 more source
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 +2 more
wiley +1 more source
Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs
Sensors, 2017 Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult.
Eun-Seok Cho, Yongbin Yim, Sang-Ha Kim
doaj +1 more source
On random planar graphs, the number of planar graphs and their triangulations
Journal of Combinatorial Theory, Series B, 2003 This paper investigates random planar graphs---the number of planar graphs and their triangulations. A random planar graph \(P_n\) is selected uniformly from \(\alpha_n\) where \(\alpha_n\) is the set of labelled planar graphs with \(\{1,2,3,\dots, n\}\) as vertex set. The following are the main results: (1) \(|\alpha_n|\leq n!(37.3)^{n+o(n)}\).
Deryk Osthus +2 more
openaire +1 more source
Morphing Planar Graph Drawings Efficiently
, 2013 A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times.
Vincenzo Roselli +7 more
core +1 more source
Crossing Layout in Non-planar Graph Drawings
, 2020 Edge crossings are a major obstruction for the readability of graph layouts as has been shown in several empirical studies. Yet, non-planar graphs are abundant in network visualization applications.
Martin Nöllenburg, Nöllenburg, Martin
core +1 more source
, 2022 Data Management Plan for the Planar Graph Classifier Project. More information is available on the project repository or in the report detailing the goal, training process, and result of the Planar Graph ...
Hummel, Matthias
core +1 more source
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 +4 more
wiley +1 more source
Planar Graph Classifier - Class Information
, 2022 CSV files associating image files from the Planar Graph Classifier - Generated Graph Images (10.5281/zenodo.6510092) with planarity information.
Hummel, Matthias
core +1 more source
Advanced Engineering Materials, EarlyView.This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat +7 more
wiley +1 more source