Results 11 to 20 of about 2,664,283 (267)
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]
, 2006 This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A +3 more
core +6 more sources
Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees
CoRR, 2021 Horizontal gene transfer events partition a gene tree $T$ and thus, its leaf set into subsets of genes whose evolutionary history is described by speciation and duplication events alone. Indirect phylogenetic methods can be used to infer such partitions $\mathcal{P}$ from sequence similarity or evolutionary distances without any a priory knowledge ...
David Schaller 0001 +2 more
openaire +3 more sources
Journal of Hydroinformatics, 2022 Landscape discretization is an essential hydrological modeling pre-processing step that comprises the numerical representation of different geographical objects considered in the modeling process and the connections between these objects within a graph ...
Philippe Lagacherie +6 more
doaj +1 more source
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs [PDF]
Discrete Mathematics, 2019 Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with $δ(G)\geq \lfloor\frac{3}{2}k\rfloor+m-1$ contains a subtree $T'$ isomorphic to $T$ such that $G-V(T')$ is $k$-connected. The conjecture has been verified for paths, trees when $k=1$
Yingzhi Tian +3 more
openaire +3 more sources
Trudy Odesskogo Politehničeskogo Universiteta, 2019 The development of industry has revealed the need for a wide variety of production facilities with special requirements for their acoustic characteristics.
Інна Сергіївна Сінько +3 more
doaj +5 more sources
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source
tree-sitter/tree-sitter-graph: v0.11.0
, 2023 Find more info on all releases at https://crates.io/crates/tree-sitter ...
Rix, Rob +2 more
core +1 more source
Spanning trees and orientations of graphs [PDF]
Journal of Combinatorics, 2010 A conjecture of Merino and Welsh says that the number of spanning trees τ (G) of a loopless and bridgeless multigraph G is always less than or equal to either the number a(G) of acyclic orientations, or the number c(G) of totally cyclic orientations, that is, orientations in which every edge is in a directed cycle.
openaire +1 more source
ORIENTED FLIP GRAPHS, NONCROSSING TREE PARTITIONS, AND REPRESENTATION THEORY OF TILING ALGEBRAS [PDF]
Glasgow Mathematical Journal, 2019 AbstractThe purpose of this paper is to understand lattices of certain subcategories in module categories of representation-finite gentle algebras called tiling algebras, as introduced by Coelho Simões and Parsons. We present combinatorial models for torsion pairs and wide subcategories in the module category of tiling algebras.
ALEXANDER GARVER, THOMAS MCCONVILLE
openaire +2 more sources
The complexity of two graph orientation problems [PDF]
, 2012 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D. +7 more
core +1 more source