Results 251 to 260 of about 954,754 (291)
Decadal-scale pollen records link land use and plant diversity change across European lowlands over seven millennia. [PDF]
Nat CommunRey F +7 more
europepmc +1 more source
Genomic diversity of <i>Pseudomonas aeruginosa</i> causing bacteremic pneumonia in an intensive care unit, with emergence of an OXA-796-producing NDM-1 ST773 isolate. [PDF]
Microb GenomLee K, Chung H, Park K, Choi SH, Sung H.
europepmc +1 more source
Phylogeography and molecular evolution of Newcastle disease virus across a century of global surveillance. [PDF]
Virus ResUl-Rahman A, Shabbir MZ, Munir M.
europepmc +1 more source
A multi-source remote sensing and machine learning framework for maize mapping and yield estimation in fragmented Loess gully regions. [PDF]
Front Plant SciSun L +7 more
europepmc +1 more source
Automated counting of spanning trees for several infinite families of graphs
Enumerative Combinatorics and ApplicationsPablo Blanco, Doron Zeilberger
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2010
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki
exaly +4 more sources
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki
exaly +4 more sources
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 International audienceThe search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees.
Olivier Togni, Benoit Darties
exaly +2 more sources
Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
exaly +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
exaly +2 more sources
International Journal of Foundations of Computer Science, 2013
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +1 more source
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +1 more source
Mathematics of Operations Research, 1995
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.
openaire +1 more source
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.
openaire +1 more source