# Edge contraction

## 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

- Inf. Process. Lett.
- 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

- 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

- Parallel Computing
- 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

- 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?