Sciweavers

4137 search results - page 498 / 828
» On the number of matchings of a tree
Sort
View
RECOMB
2010
Springer
15 years 5 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
LPAR
2010
Springer
15 years 4 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...
ICUMT
2009
15 years 4 months ago
Towards real implementations of dynamic robust routing exploiting path diversity
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
Luca Muscariello, Diego Perino, Bruno Nardelli
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
15 years 4 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
EJC
2011
15 years 1 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades