×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [pair u]
An algorithm for counting maximum weighted independent sets and its application. Appeared in SODA 02, by Vilhelm Dahullof, Peter Jonsson Presenter Jie
225 views
Approximation Algorithm: Iterative Rounding Lecture 15: March 9
222 views
Algorithms for Concave Cost Network Flow Problems Kamesh Munagala Stanford University
222 views
A Semi-Persistent Clustering Technique for VLSI Circuit Placement Charles J. Alpert 1, Andrew Kahng 2, Gi-Joon Nam 1, Sherief Reda 2 and Paul G. Villarrubia
227 views
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
214 views
1 Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21
224 views
cover times, blanket times, and majorizing measures Jian Ding U. C. Berkeley James R. Lee University of Washington Yuval Peres Microsoft Research TexPoint
216 views
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh
230 views
CS 2210(22C:19) Discrete Math Graphs Spring 2015 Sukumar Ghosh
226 views
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
219 views
Graphs
17 views
A Semi-Persistent Clustering Technique for VLSI Circuit Placement
38 views
< Prev
Next >