# 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… (More)
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
• Computers & Graphics
• 2018
Recently, discrete Morse vector fields have been shown to be useful in various applications. Analogous to the simplification of… (More)
Is this relevant?
2014
2014
• Acta Informatica
• 2014
For any graph class $$\mathcal{H}$$ H , the $$\mathcal{H}$$ H -Contraction problem takes as input a graph $$G$$ G and an integer… (More)
Is this relevant?
2014
2014
We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width.
Is this relevant?
2013
2013
• IEEE International Conference on Robotics and…
• 2013
We present Roadmap Sparsification by Edge Contraction (RSEC), a simple and effective algorithm for reducing the size of a motion… (More)
Is this relevant?
2004
2004
• IEEE Transactions on Visualization and Computer…
• 2004
We present a novel mesh simplification algorithm. It decouples the simplification process into two phases: shape analysis and… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We study edge contractions in simplicial complexes and local conditions under which they preserve the topological type. The… (More)
Is this relevant?
1997
1997
Computing a ll-reducing ordering of a sparse matrix is a central problem in the solution of sparse linear systems using direct… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Many image analysis tasks lead to or make use of graph structures that are related through the analysis process with the planar… (More)
Is this relevant?
1982
1982
• STOC
• 1982
For a property -&-pgr; on graphs, the corresponding edge-deletion problem PED(-&-pgr;) (edge-contraction problem PEC(-&-pgr… (More)
Is this relevant?
1981
1981
• Discrete Applied Mathematics
• 1981
Let G = (I&&) denote an undirected graph with node set c/G and edge set EG. If n is a property on graphs, let S(w) denote the… (More)
Is this relevant?