The combinatorics of evolutionary trees---a survey.
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “Encodings of cladograms and labeled trees.”
The combinatorics of evolutionary trees---a survey.
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Deciding soccer scores and partial orientations of graphs.
Pálvölgyi, Dömötör (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Complexes of Directed Trees of Complete Multipartite Graphs
Duško Jojić (2012)
Publications de l'Institut Mathématique
Similarity:
Helly Property for Subtrees
Jessica Enright, Piotr Rudnicki (2008)
Formalized Mathematics
Similarity:
We prove, following [5, p. 92], that any family of subtrees of a finite tree satisfies the Helly property.MML identifier: HELLY, version: 7.8.09 4.97.1001
The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
Rosário Fernandes (2015)
Special Matrices
Similarity:
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2....
Generalized connected domination in graphs.
Kouider, Mekkia, Vestergaard, Preben Dahl (2006)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Dissimilarity vectors of trees are contained in the tropical Grassmannian.
Iriarte Giraldo, Benjamin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
Paulden, Tim, Smith, David K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm
Gerritzen, L. (2004)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 17A50, 05C05. In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).
Programming and Testing a Two-Tree Algorithm
Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...