Concept

Edge contraction

OpenAlex ID: C204562854

Paths, Trees, and Flowers

2009 · Jack Edmonds · Birkhäuser Boston eBooks · 1,569

Path-based depth-first search for strong and biconnected components

2000 · Harold N. Gabow · Information Processing Letters · 181

Edge Contraction Pooling for Graph Neural Networks

2019 · Diehl, Frederik · arXiv (Cornell University) · 167

PDF

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

2004 · David R. Karger, Philip Klein, et al. · Mathematics of Operations Research · 107

PDF

Determining edge connectivity in 0(nm)

1987 · David W. Matula · Annual Symposium on Foundations of Computer Science · 88

Adaptive tetrahedral meshing in free-surface flow

2005 · Meizhong Dai, David P. Schmidt · Journal of Computational Physics · 87

Agreement via the edge laplacian

2007 · Daniel Zelazo, Amirreza Rahmani, et al. · IEEE Conference on Decision and Control (CDC) · 81

Graph minimum linear arrangement by multilevel weighted edge contractions

2004 · Ilya Safro, Dorit Ron, et al. · Journal of Algorithms · 76

Reducing edge connectivity to vertex connectivity

1991 · Zvi Galil, Giuseppe F. Italiano · ACM SIGACT News · 75

Graph-based Semi-Supervised & Active Learning for Edge Flows

2019 · Junteng Jia, Michael T. Schaub, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 69

PDF

Incremental Lossless Graph Summarization

2020 · Jihoon Ko, Yunbum Kook, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 60

PDF

Enhanced remeshing from STL files with applications to surface grid generation

2006 · Desheng Wang, Oubay Hassan, et al. · Communications in Numerical Methods in Engineering · 60

Fixed edge-length graph drawing is NP-hard

1990 · Peter Eades, Nicholas C. Wormald · Discrete Applied Mathematics · 60

A multiphase approach to efficient surface simplification

2002 · Michael Garland, Eric Shaffer · 58

Computational Complexity of Combinatorial and Graph-Theoretic Problems

2011 · R. M. Karp · Springer eBooks · 57

Obtaining a Bipartite Graph by Contracting Few Edges

2013 · Pinar Heggernes, Pim Van 'T Hof, et al. · SIAM Journal on Discrete Mathematics · 53

PDF

Planar graph vertex partition for linear problem kernels

2012 · Jianxin Wang, Yongjie Yang, et al. · Journal of Computer and System Sciences · 53

PDF

Edge-contraction problems

1983 · Takao Asano, Tomio Hirata · Journal of Computer and System Sciences · 52

On the NP-hardness of edge-deletion and -contraction problems

1983 · Toshimasa Watanabe, Tadashi Ae, et al. · Discrete Applied Mathematics · 50

An effective energy-conserving contact modelling strategy for spherical harmonic particles represented by surface triangular meshes with automatic simplification

2021 · Y.T. Feng · Computer Methods in Applied Mechanics and Engineering · 48

Convergence analysis using the edge Laplacian: Robust consensus of nonlinear multi‐agent systems via ISS method

2015 · Zhiwen Zeng, Xiangke Wang, et al. · International Journal of Robust and Nonlinear Control · 48

PDF

Quantum Graphs which Optimize the Spectral Gap

2017 · Ram Band, Guillaume Lévy · Annales Henri Poincaré · 47

PDF

Fixed points of an F-contraction on metric spaces with a graph

2014 · Rakesh Batra, Sachin Vashistha · International Journal of Computer Mathematics · 45

Yet another optimal algorithm for 3-edge-connectivity

2008 · Yung H. Tsin · Journal of Discrete Algorithms · 45

PDF

Characteristics of graph languages generated by edge replacement

1987 · Annegret Habel, Hans-Jörg Kreowski · Theoretical Computer Science · 44

Works count: 683

Citation count: 5,713