Results 61 to 70 of about 1,157,203 (300)

On the decomposition of a graph into stars

Discrete Mathematics, 1981
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into edge disjoint, m-stars [1,2]. In this paper we prove that Kυ can be decomposed into any given sequence of stars Sm1, Sm2,…, Smk if ∑mi=(2υ) and mi⩽1/2υ. Further we generalize this result to the decomposition of not necessarily complete graphs.
openaire   +2 more sources

A graph rewriting programming language for graph drawing [PDF]

, 1998
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core   +1 more source

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

Advanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch, Maximilian Holland, Klaus Drechsler, Johannes Schilp   +3 more
wiley   +1 more source

Structural Decomposition of Reactions of Graph-Like Objects [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
Inspired by decomposition problems in rule-based formalisms in Computational Systems Biology and recent work on compositionality in graph transformation, this paper proposes to use arbitrary colimits to "deconstruct" models of reactions in which states ...
Tobias Heindel
doaj   +1 more source

Density-friendly Graph Decomposition [PDF]

, 2015
Decomposing a graph into a hierarchical structure via k-core analysis is a standard operation in any modern graph-mining toolkit. k-core decomposition is a simple and efficient method that allows to analyze a graph beyond its mere de-gree distribution ...
Nikolaj Tatti, Aristides Gionis
core   +1 more source

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

Decomposition of Neutrosophic Zero-divisor graph [PDF]

Neutrosophic Sets and Systems
Evaluating student performance in university English translation courses is a complex process that requires a comprehensive assessment of multiple factors.
Balakrishnan A, Kanchana M, Said Broumi, Thirugnanasambandam K   +3 more
doaj   +1 more source

OntOMat: Toward Ontology‐Based Product and Process Design Engineering and Optimization Solutions Fueling Circular Value Chains

Advanced Engineering Materials, EarlyView.
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ, Jörg Hohe, Martin Kördel, Michael Giese, Niklas Toffert, Christian Seidel, Olaf Rehme, Patrik Schneider, Oliver Focke, Elie Abi Aoun, Claas Falldorf, Beñat Gutierrez, Alexandra Kühn, Sven Torstrick-von der Lieth, Christoph Herden, Erik Johannsen, Jan‐Uwe R. Schmidt, Felix Winkelmann, Andreas Schott, Daniel Schott   +19 more
wiley   +1 more source

On the decomposition of circulant graphs using algorithmic approaches

Alexandria Engineering Journal, 2022
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees,
A. El-Mesady, Y.S. Hamed, H. Shabana
doaj   +1 more source

Integration of OpenCV‐Based Microscopic Adhesive Volume Measurement Into a Pyiron Workflow for Automated Data Analysis

Advanced Engineering Materials, EarlyView.
Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley   +1 more source