Multiple edges

Known as: Multi-edge, Multiple edge, Parallel edges 
In graph theory, multiple edges (also called parallel edges or a multi-edge), are two or more edges that are incident to the same two vertices. A… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2013
2013
We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
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
NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We formulate edge detection as statistical inference. This statistical edge detection is data driven, unlike standard methods for… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The following definitions are probably well-known among many research mathematicians. The collaboration graph C has as vertices… (More)
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
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
  • By P. D. SEYMOUR
  • 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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1966
Highly Cited
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?