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.

Review

2019

Review

2019

Network topology inference is a significant problem in network science. Most graph signal processing (GSP) efforts to date assume… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We consider the PC-algorithm (Spirtes et al., 2000) for estimating the skeleton and equivalence class of a very high-dimensional… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

The strong analogy between biological viruses and their computational counterparts has motivated the authors to adapt the… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

We introduce the notion of geometric constructions in Rm governed by a directed graph G and by similarity ratios which are… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… Expand

Is this relevant?

Highly Cited

1975

Highly Cited

1975

An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by $O((n + e)(c + 1))$ and… Expand

Is this relevant?

Highly Cited

1972

Highly Cited

1972

We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a… Expand

Is this relevant?

Highly Cited

1972

Highly Cited

1972

The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved… Expand

Is this relevant?