# Multiple edges

## Papers overview

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

2016

2016

- Symposium on Computational Geometry
- 2016

Let G be a connected planar (but not yet embedded) graph and F a set of additional edges not yet in G. The multiple edgeâ€¦Â (More)

Is this relevant?

2013

2013

- Internet Mathematics
- 2013

We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measuredâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ICALP
- 2009

Analyzing massive data sets has been one of the key motivatio ns for studying streaming algorithms. In recent years, there hasâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package providesâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Pattern Anal. Mach. Intell.
- 2003

We formulate edge detection as statistical inference. This statistical edge detection is data driven, unlike standard methods forâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- LCN
- 2003

Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensedâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 1995

The following definitions are probably well-known among many research mathematicians. The collaboration graph C has as verticesâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- ICCV
- 1990

It is well known that the projection of depth or orientation discontinuities in a physical scene results in image intensity edgesâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- 1979

1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, lâ€¦Â (More)

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- 1966

Let G " be a non-directed graph having n vertices, without parallel edges and slings. Let the vertices of Gn be denoted by F 1â€¦Â (More)

Is this relevant?