Sciweavers

3396 search results - page 178 / 680
» Tree representations of graphs
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
GLOBECOM
2009
IEEE
14 years 3 months ago
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks
—Ethernet is widely used in Local Area Networks (LANs) due to its simplicity and cost effectiveness. Today, a great deal of effort is being devoted to extending Ethernet capabili...
Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker
JCT
2006
77views more  JCT 2006»
13 years 9 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 8 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
FOCS
1996
IEEE
14 years 1 months ago
A 3-Approximation for the Minimum Tree Spanning k Vertices
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
Naveen Garg