903 search results - page 11 / 181 » Non-well-founded trees in categories |
108
click to vote
VISSYM
2004
15 years 1 months ago
2004
Phylogenetic trees are built by examining differences in the biological traits of a set of species. An example of such a trait is a biological network such as a metabolic pathway,...
125
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
CGF
2008
14 years 11 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
JUCS
2007
14 years 11 months ago
2007
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
GLVLSI
2008
IEEE
14 years 12 months ago
2008
IEEE
This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butterfly-FatTree topolo...