Results 81 to 90 of about 1,724,695 (249)

Oriented graph coloring [PDF]

, 2001
An oriented k-coloring of an oriented graph G (that is a digraph with no cycle of length 2) is a partition of its vertex set into k subsets such that (i) no two adjacent vertices belong to the same subset and (ii) all the arcs between any two subsets ...
Sopena, Eric, Eric Sopena
core   +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

Oriented Chromatic Number of Cartesian Products and Strong Products of Paths

Discussiones Mathematicae Graph Theory, 2019
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj   +1 more source

AlgoDeGrafos: An Application to Assist in Course Lectures on Graph Theory

CLEI Electronic Journal, 2009
This paper describes an application of the object-oriented paradigm to the construction of AlgoDeGrafos, a graph-theoretical system enabling the use of graph algorithms.
Denis S. Silveira, Valdir A. Melo, Paulo O. Boaventura Netto   +2 more
doaj   +1 more source

Supporting AI Readiness Through Digital Workflows in Materials Science

Advanced Engineering Materials, EarlyView.
Digitalization drives innovation in materials science by connecting data silos and turning heterogeneous processes into reusable research pipelines. Across 13 MaterialDigital projects, digital workflows reveal complementary pathways toward AI‐ready materials research, founded on structured data, persistent artifacts, executable orchestration, and ...
Marian Bruns, Lateef Abdul, Stephan Barth, Martin Glauer, Manuel Günther, Fabian Neuhaus, Jan‐Ole Perschewski, Thomas Bjarsch, Henrik Abel, Johannes Bosch, Niklas Meyer, Peter Hofmann, Marc Drechsler, Alexander Dyck, Dhanunjaya Kumar Nerella, Marvin Tegeler, Oleg Shchyglo, Ingo Steinbach, Timo Klecker, Henk Birkholz, Ehsan Borzabadi Farahani, Bernard Fedelich, Cetin Haftaoglu, Tarakeshwar Lakshmipathy, Elena Garcia Trelles, Christoph Schweizer, Reza Darvishi Kamachali, Lukas Koschmieder, Janin Eiken, Markus Apel, Sung‐Min Wi, Jiangdong Zhao, Andreas Fezer, Nicolas Christ, Patrick Schneider, Eldor Urinov, Veit Königer, Volker Knoblauch, Janik Harter, Thomas Seifert, Thitichai Janpheng, Florian Fuchs, Fabian Teichert, Jörg Schuster, Anke Bardehle, Andreas Limper, Ulrich Giese, Carlos Lucke, Mario Beiner, Christoph Gögelein, Lisa Leuchtenberger‐Engel, Christian Hopmann, Felix Wentzien, Heike Wittek, Benjamin Klie, Alexander Röhrs, Ludger Overmeyer, Achraf Atila, Marcel Sadowski, Leopold Talirz, Jan Janssen, Jesper R. Pedersen, Peter Beck, Tejs Vegge, Ivano E. Castelli, Wolfgang Wenzel, Tilmann Hickel, Jörg Schaarschmidt   +67 more
wiley   +1 more source

Graph Algorithm Animation with Grrr [PDF]

, 2000
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers, Rodgers, Peter, Vidal, Natalia, Natalia Vidal   +3 more
core   +1 more source

Oriented Incidence Colourings of Digraphs

Discussiones Mathematicae Graph Theory, 2019
Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher, MacGillivray Gary, Ochem Pascal, Raspaud André   +3 more
doaj   +1 more source

Cryogenic Deformation Behavior of TiAl and Insights Into Embrittlement After High‐Temperature Exposure Combined With Secondary Ion Mass Spectroscopy of Near Surface Chemistry

Advanced Engineering Materials, EarlyView.
Near‐surface deuterium enrichment profiles for different microstructural types of TiAl after exposure at 700 °C in a heavy water‐containing environment. The deuterium levels are significantly higher than expected from natural occurrence, indicating that the heavy water dissociated during the exposure treatment and entered the specimens.
Jonathan D. H. Paul, Alexander Welle, Dirk Matthiessen, Michael Oehring, Fritz Appel, Florian Pyczak   +5 more
wiley   +1 more source

Genus Distribution for a Graph [PDF]

, 2009
In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan, Yanpei, Liu, Hong-Jian, Lai   +2 more
core   +1 more source

Structure‐Guided Dynamical Mechanics in Bioinspired Double Twisted Laminated Thin Films

Advanced Functional Materials, EarlyView.
This work explores a dynamic mechanistic study of crack propagation and puncture testing via real‐time monitoring of crack initiation, propagation, and termination through nature‐inspired single and double twisted architectures fabricated from cellulose nanocrystals.
Justin Brackenridge, Olivia Harper, Jaejun Lee, Sergio Gonzalez‐Munoz, Vladimir V. Tsukruk   +4 more
wiley   +1 more source