Results 11 to 20 of about 302,672 (265)
Connecting infinity to soft factors
Journal of High Energy PhysicsIn this note we study tree-level scattering amplitudes of gravitons under a natural deformation which in the large z limit can be interpreted either as a k-hard-particle limit or as a (n − k)-soft-particle limit. When k = 2 this becomes the standard BCFW
Freddy Cachazo, Pablo Leon
doaj +3 more sources
Connected Factors in Graphs ? a Survey [PDF]
Graphs and Combinatorics, 2005 A subgraph \(F\) of a graph \(G\) is called a factor of \(G\) if \(V(F)= V(G)\) and \(E(F)\subseteq E(G)\). In other words \(F\) is a spanning subgraph of \(G\). A survey of factors of \(G\) that add additional restrictions on \(F\) are studied in this paper. For example, if \(f\) is a function from \(V(G)\) into the nonnegative integers, then \(F\) is
Vestergaard, Preben Dahl +1 more
openaire +4 more sources
Approximability of Connected Factors [PDF]
, 2014 Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling ...
Kamiel Cornelissen +4 more
openaire +5 more sources
Connected k-factors in bipartite graphs
Discrete Mathematics, 2023 Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is a graph containing no induced subgraph isomorphic to $S_{k,l}$.
Yandong Bai, Binlong Li
openaire +4 more sources
Factorization connecting continuum & lattice TMDs
Journal of High Energy Physics, 2022 Abstract Transverse-momentum-dependent parton distribution functions (TMDs) can be studied from first principles by a perturbative matching onto lattice-calculable quantities: so-called lattice TMDs, which are a class of equal-time correlators that includes quasi-TMDs and TMDs in the Lorentz-invariant approach.
Markus A. Ebert +3 more
openaire +5 more sources
Amalgamations of connected k-factorizations
Journal of Combinatorial Theory, Series B, 2003 Let \(G\) be an edge-colored graph on the set of colors \(\{ 1,2,\ldots,n\}\), and let \(P\) be a partition of \(V(G)\). The \(P\)-amalgamation of \(G\) is the \(n\)-edge-colored graph with vertex set \(P\), in which \(p\in P\) is incident with \(y\) loops colored \(i\) if and only if there are \(y\) loops or edges in \(G\) that join vertices in \(p\),
Anthony J. W. Hilton +3 more
openaire +3 more sources
FORENSIC ENGINEERING ANALYSIS OF BUILDING STRUCTURES IN INDONESIA: A CASE STUDY OF THE COLLAPSE OF THE MAHAKAM II KUTAI KARTANEGARA BRIDGE IN EAST BORNEO [PDF]
Russian Journal of Agricultural and Socio-Economic Sciences, 2019 The objectives of this research are: 1) to provide an overview of the analysis of forensic engineering in bridge structures, 2) to obtain an overview of the application of forensic engineering in Indonesia.
Kamaluddin, Wahyono A.H., Iskandar T.
doaj +1 more source
SHS Web of Conferences, 2018 Obligation law unstable nature under contractual succession discrete situations forces to find appropriate connecting factor which secures involved persons testamentary interests.
Pilipson Edvard
doaj +1 more source
Transport, 2016 The main objective of this study was to explore quality increasing and cost reduction opportunities for a production of forged aluminium alloy 6082 connecting rods. These automotive parts are used for air compressors’ of the trucks.
Rasa Kandrotaitė-Janutienė
doaj +1 more source
On the Complexity Landscape of Connected f-Factor Problems [PDF]
Algorithmica, 2019 Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The subgraph H is called a connected f-factor if, in addition, H is connected.
Robert Ganian +4 more
openaire +12 more sources