# Directed graph

## Papers overview

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

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2006

Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important andâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- ICML
- 2005

We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of theâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- J. Graph Algorithms Appl.
- 2000

We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placementâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- COCOON
- 1999

The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph This graph is a fascinatingâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- IEEE Trans. Software Eng.
- 1993

We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a networkâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- IEEE Symposium on Security and Privacy
- 1991

Despite serious concerns raised by the proven ability of computer viruses to spread between individua.1 systems and establishâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- VL
- 1989

Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic modelâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- IEEE Transactions on Computers
- 1986

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithmsâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- SIAM J. Comput.
- 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â€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be aâ€¦Â (More)

Is this relevant?