Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

The mining of outliers (or anomaly detection) in large databases continues to remain an active area of research with many… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

A collection of <italic>n</italic> balls in <italic>d</italic> dimensions forms a <italic>k</italic>-ply system if no point in… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single… Expand

Is this relevant?

1992

1992

The Planar Separator Theorem of Lipton and Tarjan [73] says that in any undirected planar graph G there exists a small separator… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

Abstract We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 2√2 · n… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges whose removal divides the… Expand

Is this relevant?

1980

1980

Summary1.Absolute thresholds to tone and noise bursts were measured for 177 single auditory fibers in the eighth nerves of 8… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1977

Highly Cited

1977

Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n… Expand

Is this relevant?

1977

1977

Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n… Expand

Is this relevant?