Results 61 to 70 of about 1,423 (126)

Convex Independence in Permutation Graphs

open access: yes, 2016
A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest P_3-convex set that contains A.
B Courcelle   +11 more
core   +1 more source

Feynman graph generation and calculations in the Hopf algebra of Feynman graphs

open access: yes, 2014
Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and $\varphi^k$ theories.
Borinsky, Michael
core   +1 more source

Combinatorial Hopf algebraic description of the multiscale renormalization in quantum field theory [PDF]

open access: yes, 2013
We define in this paper several Hopf algebras describing the combinatorics of the so-called multi-scale renormalization in quantum field theory. After a brief recall of the main mathematical features of multi-scale renormalization, we define assigned ...
Krajewski, Thomas   +2 more
core   +1 more source

Indirect identification of horizontal gene transfer. [PDF]

open access: yesJ Math Biol, 2021
Schaller D   +4 more
europepmc   +1 more source

Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. [PDF]

open access: yesJ Math Biol, 2021
Schaller D   +3 more
europepmc   +1 more source

On Some Combinatorial Problems in Cographs [PDF]

open access: green, 2022
Harshita Kona, Sadagopan, N.
openalex   +1 more source

Home - About - Disclaimer - Privacy