MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "An o(min(m" – sorted by Relevance.

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

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

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

ATOM

An O(n 2.75 ) algorithm for online topological ordering
by Deepak Ajwani, Tobias Friedrich, Ulrich Meyer — 2006 — In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, LNCS 4059
… DAGs, this is an im- provement over the previous best result of O(min{m 3 2 log n,m 3 2 + n 2 log n…
Cited by 4 (1 self) – Add To MetaCart

Spanning Trees Crossing Few Barriers
by Tetsuo Asano, Mark de Berg, Otfried Cheong, Mark Berg Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki — 2002 — in: Proc. 15th ACM Symp. Comput. Geom
… of cost O(min(m 2, mx/)); (ii) if the barriers are disjoint line segments, then there is always a…
Cited by 2 (0 self) – Add To MetaCart

Tree Decompositions With Small Cost
by Irit Katriel , Hans L. Bodlaender — 2005 — IN PROCEEDINGS OF THE 16TH ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
… of the nodes of a directed acyclic graph while inserting m edges can be solved in O(min{m 3/2 log n, m 3/2 + n…
Add To MetaCart

Maintaining a minimum spanning tree under transient node failures
by Enrico Nardelli, Guido Proietti — Proc. of the 8th European Symposium on Algorithms (ESA 2000
… in G. We show that this problem can be solved in O(min(m · α(n, n),m+ n log n)) time and O(m) space…
Cited by 1 (1 self) – Add To MetaCart

Probabilistic Analysis of Two Complexity Measures for Linear Programming Problems
by M.J. Todd, Levent Tunçel, Yinyu Ye — 1998 — Math. Prog. A
… matrix, then E(ln #A ) = O(min{m ln n, n}). Thus, the expected running time of linear programming…
Cited by 8 (3 self) – Add To MetaCart

Faster algorithms for online topological ordering
by Telikepalli Kavitha, Rogers Mathew, Telikepalli Kavitha, Rogers Mathew — 2007
… algorithms for the online topological ordering problem run in time O(min(m 3/2 logn,m 3/2 + n 2 logn)) and O…
Cited by 2 (0 self) – Add To MetaCart

Improved Data Structures for Fully Dynamic Biconnectivity
by Monika Rauch Henzinger — 1997 — Proc. 26th ACM Symp. Theory of Computing
… of vertices in a graph. The time per operation of the previously best deterministic algorithms were O(min{m 2…
Cited by 2 (0 self) – Add To MetaCart

Improved Algorithms for Maintaining Transitive Closure and All-pairs Shortest Paths in Digraphs under edge deletions
by Surender Baswana, Ramesh Hariharan, Sandeep Sen — 2001
… achieving O(1) query time require O(min(m; n 3 =m)) amortized update time, thus establish an upper bound…
Cited by 3 (0 self) – Add To MetaCart

Minimal Sensor Integrity: Measuring the Vulnerability of Sensor Deployments
by Rajgopal Kannan Sarangi, Rajgopal Kannan, S. Sarangi, Sibabrata Ray, S. S. Iyengar — 2003 — Information Processing Letters
… coverages form an interval graph (as in a linear grid), we describe a better O(min(M 2 ,NM)) dynamic…
Cited by 1 (0 self) – Add To MetaCart

The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
by Maciej Gebala Institute, Maciej Gebala — 1998 — Logics of Knowledge and Belief, Proc. IJCAI'85
… complexity O(min(m; n) 2 \Delta mn log mn). In section 2 we describe some properties of convex polyominoes…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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