Fetching the paper…
Reading the bibliography…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a more convenient manner.
Structural determination of paraffin boiling points
Harry Wiener · 1947
Earlier work this paper cites.
An r r -dimensional quadratic placement algorithm
Kenneth M Hall · 1970
Earlier work this paper cites.
An effective heuristic algorithm for the traveling-salesman problem
Shen Lin and Brian W Kernighan · 1973
Earlier work this paper cites.
A lower bound for the first eigenvalue of the laplacian on a compact manifold
Peter Li · 1979
Earlier work this paper cites.
New spectral methods for ratio cut partitioning and clustering
Lars Hagen and Andrew B Kahng · 1992
Earlier work this paper cites.
Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
Stephen T Barnard and Horst D Simon · 1994
Earlier work this paper cites.
A combinatorial laplacian with vertex weights
Fan RK Chung and Robert P Langlands · 1996
Earlier work this paper cites.
Spectral graph theory
Fan RK Chung and Fan Chung Graham · 1997
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
George Karypis and Vipin Kumar · 1998
Earlier work this paper cites.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik · 2000
Earlier work this paper cites.
What energy functions can be minimized via graph cuts?
Vladimir Kolmogorov and Ramin Zabih · 2002
Earlier work this paper cites.
A unified view of kernel k-means, spectral clustering and graph cuts
Inderjit S Dhillon, Yuqiang Guan, and Brian Kulis · 2004
Earlier work this paper cites.
Calculus on graphs
Joel Friedman and Jean-Pierre Tillich · 2004
Earlier work this paper cites.
ω \omega -harmonic functions and inverse conductivity problems on networks
Soon-Yeong Chung and Carlos A Berenstein · 2005
Cited alongside, same era.
Balanced graph partitioning
Konstantin Andreev and Harald Racke · 2006
Cited alongside, same era.
Weighted graph cuts without eigenvectors a multilevel approach
Inderjit S Dhillon, Yuqiang Guan, and Brian Kulis · 2007
Cited alongside, same era.
The p p -laplacian – mascot of nonlinear analysis
Pavel Drábek · 2007
Cited alongside, same era.
Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices
Cevdet Aykanat, B Barla Cambazoglu, and Bora Uçar · 2008
Cited alongside, same era.
A concise and provably informative multi-scale signature based on heat diffusion
Jian Sun, Maks Ovsjanikov, and Leonidas Guibas · 2009
Cited alongside, same era.
Vertex-weighted graphs and their applications
Jeff R Knisley and Debra J Knisley · 2014
Later among the works it cites.
Weighted graph clustering for community detection of large social networks
Ruifang Liu, Shan Feng, Ruisheng Shi, and Wenbin Guo · 2014
Later among the works it cites.
On the p p -laplacian and ∞ \infty -laplacian on graphs with applications in image and data processing
Abderrahim Elmoataz, Matthieu Toutain, and Daniel Tenbrinck · 2015
Later among the works it cites.
Advanced coarsening schemes for graph partitioning
Ilya Safro, Peter Sanders, and Christian Schulz · 2015
Later among the works it cites.
Hitting time for doubly-weighted graphs with application to robotic surveillance
Andrea Carron, Rushabh Patel, and Francesco Bullo · 2016
Later among the works it cites.
A k-way greedy graph partitioning with initial fixed vertices for parallel applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonlocal diffusion problems
Fuensanta Andreu-Vaillo, J Julian Toledo-Melero, Jose M Mazon, and Julio D Rossi · 2010
Cited alongside, same era.
Engineering a scalable high quality graph partitioner
Manuel Holtgrewe, Peter Sanders, and Christian Schulz · 2010
Cited alongside, same era.
Total variation, cheeger cuts
Arthur Szlam and Xavier Bresson · 2010
Cited alongside, same era.
Graph energy
Xueliang Li, Yongtang Shi, and Ivan Gutman · 2012
Cited alongside, same era.
Community detection and graph partitioning
Mark EJ Newman · 2013
Cited alongside, same era.
Finite difference methods for the infinity laplace and p p -laplace equations
Adam M Oberman · 2013
Cited alongside, same era.
Maria Predari and Aurélien Esnard · 2016
Later among the works it cites.
Weighted graph laplacian and image inpainting
ZUOQIANG Shi, STANLEY Osher, and W Zhu · 2016
Later among the works it cites.
A self-balanced min-cut algorithm for image clustering
Xiaojun Chen, Joshua Zhexue Haung, Feiping Nie, Renjie Chen, and Qingyao Wu · 2017
Later among the works it cites.
Balanced clustering with least square regression
Hanyang Liu, Junwei Han, Feiping Nie, and Xuelong Li · 2017
Later among the works it cites.
Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices
Maria Predari, Aurélien Esnard, and Jean Roman · 2017
Later among the works it cites.
A review of clustering techniques and developments
Amit Saxena, Mukesh Prasad, Akshansh Gupta, Neha Bharill, Om Prakash Patel, Aruna Tiwari, Meng Joo Er, Weiping Ding, and Chin-Teng Lin · 2017
Later among the works it cites.
Harmonic cycles for graphs
Younng-Jin Kim and Woong Kook · 2019
Closest in time.
Sampling and multilevel coarsening algorithms for fast matrix approximations
Shashanka Ubaru and Yousef Saad · 2019
Closest in time.