Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Edge contraction

Known as: Vertex identification, Graph contraction, Edge-contraction 
In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging the two vertices that it… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well… Expand
  • figure 3.1
  • figure 3.2
  • figure 3.4
  • figure 3.5
  • figure 4.1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We introduce symmetry hierarchy of man‐made objects, a high‐level structural representation of a 3D model providing a symmetry… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • M. Kurant, P. Thiran
  • IEEE Journal on Selected Areas in Communications
  • 2007
  • Corpus ID: 17937981
Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The tilt of Saturn's spin axis to its orbit plane is 267, while that of Jupiter is only 31. We offer an explanation for this… Expand
  • table 1
  • table II
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The authors tested the hypothesis that a broad or narrow scope of perceptual attention engenders an analogously broad or narrow… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The flow of a polystyrene Boger fluid through axisymmetric contraction‐expansions having various contraction ratios (2 8) and… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. They… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We investigate a new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • table III
Is this relevant?
Highly Cited
1966
Highly Cited
1966
 
Is this relevant?