Results 21 to 30 of about 145,190 (272)

Combinatorics of Multicompositions [PDF]

open access: yes, 2021
13 ...
Hopkins, Brian, Ouvry, Stéphane
openaire   +3 more sources

The generalized 3-connectivity of Cartesian product graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj   +1 more source

The Real-rootedness of Eulerian Polynomials via the Hermite–Biehler Theorem [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
Based on the Hermite–Biehler theorem, we simultaneously prove the real-rootedness of Eulerian polynomials of type $D$ and the real-rootedness of affine Eulerian polynomials of type $B$, which were first obtained by Savage and Visontai by using the ...
Arthur L.B. Yang, Philip B. Zhang
doaj   +1 more source

On the combinatorics of sparsification [PDF]

open access: yesAlgorithms for Molecular Biology, 2012
Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity. Results: We analyze the sparsification of a particular decomposition rule, $ ^*$, that splits an interval for RNA secondary and ...
Huang, Fenix Wenda, reidys, Christian
openaire   +7 more sources

More on the Rainbow Disconnection in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-
Bai Xuqing   +3 more
doaj   +1 more source

Oriented diameter and rainbow connection number of a graph [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Xiaolong Huang   +3 more
doaj   +1 more source

Constrained ear decompositions in graphs and digraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj   +1 more source

What Dynamic Approaches Have Taught Us About Cognition and What They Have Not: On Values in Motion and the Importance of Replicable Forms

open access: yesTopics in Cognitive Science, EarlyView., 2023
Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley   +1 more source

A subexponential-time, polynomial quantum space algorithm for inverting the CM group action

open access: yesJournal of Mathematical Cryptology, 2020
We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David   +3 more
doaj   +1 more source

Polynomial reconstruction of the matching polynomial

open access: yesElectronic Journal of Graph Theory and Applications, 2015
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj   +1 more source

Home - About - Disclaimer - Privacy