Results 71 to 80 of about 2,192,848 (347)
The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
, 2005 A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free groups.
Bestvina +11 more
core +1 more source
TuckER: Tensor Factorization for Knowledge Graph Completion [PDF]
Conference on Empirical Methods in Natural Language Processing, 2019 Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones.
Ivana Balazevic +2 more
semanticscholar +1 more source
Decompositions of triangle-dense graphs [PDF]
Proceedings of the 5th conference on Innovations in theoretical computer science, 2014 High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense ...
Tim Roughgarden +2 more
openaire +4 more sources
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Le Matematiche, 1990 This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of Kn into copies of G, where G may be a cycle, a path, or just a small graph.
Chris A. Rodger
doaj
Decompositions of Cubic Traceable Graphs
Discussiones Mathematicae Graph Theory, 2020 A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +1 more source
Advancing Wildfire‐Retardant Materials: Engineering Strategies for Direct and Indirect Suppression
Advanced Engineering Materials, EarlyView.Here, the evolution, ecological impact, and performance of current fire‐retardant materials and suppression strategies are reviewed, offering an engineering perspective to address existing challenges and propose pathways for the development of more effective, scalable, and sustainable solutions to meet the demands of a changing climate. Wildfires cause
Changxin Dong +4 more
wiley +1 more source
Ordered Vertex Partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules.
Ross M. McConnell, Jeremy P. Spinrad
doaj +2 more sources
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
, 2015 Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t.
Andres, Bjoern +5 more
core +2 more sources
Advanced Engineering Materials, EarlyView.The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source