Results 11 to 20 of about 6,230,123 (298)
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms [PDF]
Consider the following 2-respecting min-cut problem. Given a weighted graph $G$ and its spanning tree $T$, find the minimum cut among the cuts that contain at most two edges in $T$.
Mukhopadhyay, Sagnik, Nanongkai, Danupon
core +2 more sources
Sweet basil (Ocimum basilicum L.) is an economically important leafy vegetable especially in Mediterranean countries. In Italian gastronomy, the large elliptical leaves of the Genovese type are mostly used for the well-known pesto sauce, and almost all (&
Michele Ciriello +6 more
doaj +1 more source
A Nontransitive Theory of Truth over PA
David Ripley has argued extensively for a nontransitive theory of truth by dropping the rule of Cut in a sequent calculus setting in order to get around triviality caused by paradoxes such as the Liar.
Jonathan Dittrich
doaj +1 more source
Lithuanian authors, authors abroad, and artists have presented Lithuanian folk clothes in their works. However, the oldest examples of these representations are not very reliable, because the authors painted them according to the descriptions of other ...
Eglė Kumpikaitė, Rimvydas Milašius
doaj +1 more source
When bankers are openly pocketing many millions of pounds in bonuses, and when the wealth of the country remains obscenely concentrated in the hands of a tiny plutocracy, should we contemplate slashing public expenditure aimed at the common good? Unfortunately, egalitarian principles are unlikely to cut much ice with an incoming Tory government, nor ...
openaire +1 more source
We present an analytic technique for evaluating single cuts for one-loop integrands, where exactly one propagator is taken to be on shell. Our method extends the double-cut integration formalism of one-loop amplitudes to the single-cut case.
A Denner +56 more
core +2 more sources
A Novel h–φ Approach for Solving Eddy–Current Problems in Multiply Connected Regions
A novel h-φ approach for solving 3-D time-harmonic eddy current problems is presented. It makes it possible to limit the number of degrees of freedom required for the discretization such as the T-Ω method, while overcoming topological ...
Federico Moro +2 more
doaj +1 more source
Cut-Simulation and Impredicativity [PDF]
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for classical type ...
Benzmueller, Christoph +2 more
core +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pach, J., Tardos, G.
openaire +2 more sources
Distributed Minimum Cut Approximation [PDF]
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, $O(\log n)$ bits can be transmitted over each edge (a.k.a. the CONGEST model).
A. Das Sarma +10 more
core +1 more source

