MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Packing Trees." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

50 documents found, showing 1 through 10. Next 10 →

ATOM

Packing Trees
by Joseph Gil, Alon Itai — 1995
… 1 Packing Trees Joseph Gil and Alon Itai Department of Computer Science Technion -- Israel…
Cited by 16 (0 self) – Add To MetaCart

A Note on Packing Trees into Complete Bipartite Graphs
by Raphael Yuster
…A Note on Packing Trees into Complete Bipartite Graphs Raphael Yuster Department of Mathematics…
Add To MetaCart

A Comparison of Network Coding and Tree Packing
by Yunnan Wu , Philip A. Chou, Kamal Jain — 2004 — IN PROC. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT 2004
…A Comparison of Network Coding and Tree Packing Yunnan Wu ∗ , Philip A. Chou † , and Kamal Jain…
Cited by 13 (2 self) – Add To MetaCart

Asymptotically Optimal Tree-Packings in Regular Graphs
by Alexander Kelmans, Dhruv Mubayi, Benny Sudakov — 2001 — Electronic J. Combin
…Asymptotically optimal tree-packings in regular graphs Alexander Kelmans Rutgers University, New…
Cited by 3 (0 self) – Add To MetaCart

MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs ∗ ABSTRACT
by Tung-chieh Chen, Ping-hung Yuh, Yao-wen Chang, Fwu-juh Huang, Denny Liu
…MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs ∗ ABSTRACT Tung…
Add To MetaCart

Supremum of a Process in Terms of Trees
by Olivier Guedon, Artem Zvavitch — 2003 — In Geometric aspects of functional analysis
… of labelled-covering trees of (T, d) and a lower bound in terms of packing trees (this uses the knowledge…
Cited by 1 (0 self) – Add To MetaCart

A Greedy Algorithm for Bulk Loading R-trees
by Yván J. García R., Mario A. López, R. Mario, Scott T. Leutenegger — 1997 — Software Process Modelling and Technology
… to the coordinate axes that result in packed trees and greedily picks those optimizing an arbitrary cost function…
Add To MetaCart

Fast and accurate algorithms for protein side-chain packing
by Jinbo Xu, Bonnie Berger — 2006 — Journal of ACM
… This paper studies the protein side-chain packing problem using the tree-decomposition of a protein structure…
Cited by 2 (1 self) – Add To MetaCart

Minimum Cuts in Near-Linear Time
by David Karger — 1996 — In Proceedings of the 28 th ACM Symposium on Theory of Computing [ACM96
…-duality" between minimum cuts and maximum spanning tree packings combined with our previously developed random…
Cited by 50 (11 self) – Add To MetaCart

A fast algorithm for computing steiner edge connectivity
by Ramesh Hariharan — 2003 — Proc. of the 35th Annual ACM Symposium on Theory of Computing
… in S in time O(C 3 n log n + m). This algorithm is based on an efficient construction of tree packings which…
Cited by 8 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB