Pages that link to "Item:Q869898"

The following pages link to Spectral partitioning works: planar graphs and finite element meshes (Q869898):

Displaying 46 items.

• On the spectral gap of a quantum graph (Q312228) (← links)
• The influence of Miroslav Fiedler on spectral graph theory (Q389537) (← links)
• Graph clustering (Q458448) (← links)
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
• Consistency of regularized spectral clustering (Q533498) (← links)
• Cubic polyhedral Ramanujan graphs with face size no larger than six (Q535313) (← links)
• Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
• Metric uniformization and spectral bounds for graphs (Q659931) (← links)
• Spectral clustering and its use in bioinformatics (Q879406) (← links)
• Towards a theoretical foundation for Laplacian-based manifold methods (Q959898) (← links)
• A tearing-based hybrid parallel sparse linear system solver (Q984910) (← links)
• Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
• A tearing-based hybrid parallel banded linear system solver (Q1008699) (← links)
• A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
• Spectral concentration and greedy \(k\)-clustering (Q1624584) (← links)
• Spectral bisection with two eigenvectors (Q1690049) (← links)
• Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
• Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs (Q2001989) (← links)
• A Cheeger cut for uniform hypergraphs (Q2053692) (← links)
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs (Q2078948) (← links)
• A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization (Q2138794) (← links)
• The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
• Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs (Q2179601) (← links)
• The geometry connectivity of hypergraphs (Q2198379) (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
• Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940) (← links)
• Mean curvature, threshold dynamics, and phase field theory on finite graphs (Q2254953) (← links)
• Discrete uniformizing metrics on distributional limits of sphere packings (Q2324618) (← links)
• An upper bound on the algebraic connectivity of outerplanar graphs (Q2397528) (← links)
• A note on Fiedler value of classes with sublinear separators (Q2435377) (← links)
• On the Fiedler value of large planar graphs (Q2435468) (← links)
• Higher-order spectral clustering for geometric graphs (Q2658739) (← links)
• Social order statistics models for ranking data with analysis of preferences in social networks (Q2686019) (← links)
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data (Q2805269) (← links)
• Discrepancy and eigenvalues of Cayley graphs (Q2828826) (← links)
• (Q2857328) (← links)
• ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data (Q2964446) (← links)
• Separators in region intersection graphs (Q4638049) (← links)
• The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous (Q4906501) (← links)
• Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
• Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
• (Q5111755) (← links)
• Posterior consistency of semi-supervised regression on graphs (Q5157865) (← links)
• Efficient Point-to-Point Resistance Distance Queries in Large Graphs (Q5886033) (← links)
• Scale fragilities in localized consensus dynamics (Q6110301) (← links)
• Non-existence of annular separators in geometric graphs (Q6151030) (← links)