Search Results - "HENZINGER, M. R"

Finding related pages in the World Wide Web by Dean, Jeffrey, Henzinger, Monika R

“…When using traditional search engines, users have to formulate queries to describe their information need. This paper discusses a different approach to Web…”
Get full text

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology by HENZINGER, M. R, KING, V, WARNOW, T

Get full text

Measuring index quality using random walks on the Web by Henzinger, Monika R., Heydon, Allan, Mitzenmacher, Michael, Najork, Marc

“…Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure…”
Get full text

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity by Henzinger, Monika Rauch

“…This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph…”
Get full text

On near-uniform URL sampling by Henzinger, Monika R., Heydon, Allan, Mitzenmacher, Michael, Najork, Marc

“…We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web…”
Get full text

Average-case analysis of dynamic graph algorithms by ALBERTS, D, HENZINGER, M. R

Get full text

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs by Henzinger, M. R., Fredman, M. L.

Get full text

Computing Vertex Connectivity: New Bounds from Old Techniques by Henzinger, Monika R., Rao, Satish, Gabow, Harold N.

“…The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known…”
Get full text

Fully dynamic biconnectivity in graphs by Henzinger, M. R.

Get full text

Hyperlink analysis for the Web by Henzinger, M.R.

“…Hyperlink analysis algorithms significantly improve the relevance of the search results on the Web, so much so that all major Web search engines claim to use…”
Get full text

A comparison of techniques to find mirrored hosts on the WWW by Bharat, Krishna, Broder, Andrei, Dean, Jeffrey, Henzinger, Monika R.

“…We compare several algorithms for identifying mirrored hosts on the World Wide Web. The algorithms operate on the basis of URL strings and linkage data: the…”
Get full text

Scheduling multicasts on unit-capacity trees and meshes by Henzinger, M R, Leonardi, S

“…Future high-speed communication networks that use band-width reservation for quality-of-service guarantees depend greatly on multicast routing and admission…”
Get full text

Faster Shortest-Path Algorithms for Planar Graphs by Henzinger, Monika R, Klein, Philip, Rao, Satish, Subramanian, Sairam

“…We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time…”
Get full text

Lower bounds for fully dynamic connectivity problems in graphs: Dynamic graph algorithms by HENZINGER, M. R, FREDMAN, M. L

Get full text

Scheduling multicasts on unit-capacity trees and meshes by Henzinger, Monika R., Leonardi, Stefano

“…This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a…”
Get full text

Sampling to provide or to bound: With applications to fully dynamic graph algorithms by Henzinger, Monika R., Thorup, Mikkel

“…In dynamic graph algorithms the following provide‐or‐bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random…”
Get full text

An online throughput-competitive algorithm for multicast routing and admission control by Goel, Ashish, Henzinger, Monika R., Plotkin, Serge

“…We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of…”
Get full text

Finding anything in the billion page Web: are algorithms the key?

Get full text

Scheduling data transfers in a network and the set scheduling problem by Goel, Ashish, Henzinger, Monika R., Plotkin, Serge, Tardos, Eva

“…In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying…”
Get full text

Computing simulations on finite and infinite graphs by Henzinger, M.R., Henzinger, T.A., Kopke, P.W.

“…We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of…”
Get full text