Sciweavers

4137 search results - page 21 / 828
» On the number of matchings of a tree
Sort
View
ICCV
1999
IEEE
14 years 9 months ago
Approximate Tree Matching and Shape Similarity
Tyng-Luh Liu, Davi Geiger
GLOBECOM
2007
IEEE
14 years 2 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 7 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...