Spectral partitioning works: planar graphs and finite element meshes
From MaRDI portal
(Redirected from Publication:869898)
Recommendations
Cites work
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- scientific article; zbMATH DE number 432835 (Why is no real title available?)
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- scientific article; zbMATH DE number 3965388 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4076517 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 1263247 (Why is no real title available?)
- scientific article; zbMATH DE number 741006 (Why is no real title available?)
- scientific article; zbMATH DE number 741181 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 3438337 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 910879 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- scientific article; zbMATH DE number 3074559 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- A Theorem on Planar Graphs
- A fast algorithm for particle simulations
- A separator theorem for graphs of bounded genus
- An r-Dimensional Quadratic Placement Algorithm
- An Algorithm for Partitioning the Nodes of a Graph
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Combinatorial aspects of geometric graphs
- Condition of finite element matrices generated from nonuniform meshes.
- Diameters and Eigenvalues
- Direct Discretization of Planar Div-Curl Problems
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Eigenvalues and expanders
- Eigenvectors of acyclic matrices
- Expander flows, geometric embeddings and graph partitioning
- Finding Separator Cuts in Planar Graphs within Twice the Optimal
- Geometric Separators for Finite-Element Meshes
- Geometric bounds for eigenvalues of Markov chains
- Isoperimetric numbers of graphs
- Lower Bounds for the Partitioning of Graphs
- ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
- ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- On the Angle Condition in the Finite Element Method
- Open problems of Paul Erd�s in graph theory
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
- Provably good mesh generation
- Recent directions in netlist partitioning: a survey
- Separators for sphere-packings and nearest neighbor graphs
- Separators in graphs with negative and multiple vertex weights
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(68)- Non-existence of annular separators in geometric graphs
- Posterior consistency of semi-supervised regression on graphs
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection
- Scale fragilities in localized consensus dynamics
- scientific article; zbMATH DE number 736319 (Why is no real title available?)
- An improved spectral lower bound of treewidth
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Ordering trees and graphs with few cycles by algebraic connectivity
- Higher-order spectral clustering for geometric graphs
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
- A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization
- scientific article; zbMATH DE number 910879 (Why is no real title available?)
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral trisection of finite element models
- Graph clustering
- Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- A tearing-based hybrid parallel banded linear system solver
- Improvements on spectral bisection
- Approximating unique games using low diameter graph decomposition
- Discrete uniformizing metrics on distributional limits of sphere packings
- New abilities and limitations of spectral graph bisection
- Towards a theoretical foundation for Laplacian-based manifold methods
- Consistency of regularized spectral clustering
- Discrepancy and eigenvalues of Cayley graphs
- Social order statistics models for ranking data with analysis of preferences in social networks
- The normalized graph cut and Cheeger constant: from discrete to continuous
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
- Metric uniformization and spectral bounds for graphs
- Spectral bisection with two eigenvectors
- Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
- A spectral lower bound for the treewidth of a graph and its consequences
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- A tearing-based hybrid parallel sparse linear system solver
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- scientific article; zbMATH DE number 7306882 (Why is no real title available?)
- Spectral concentration and greedy \(k\)-clustering
- Separators in region intersection graphs
- Diffuse interface models on graphs for classification of high dimensional data
- On the structure of isometrically embeddable metric spaces
- Local regularization of noisy point clouds: improved global geometric estimates and data analysis
- An exact approach for the multi-constraint graph partitioning problem
- Efficient Point-to-Point Resistance Distance Queries in Large Graphs
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- An efficient spectral method for bisection of regular finite element meshes
- The influence of Miroslav Fiedler on spectral graph theory
- Spectral clustering and its use in bioinformatics
- An upper bound on the algebraic connectivity of outerplanar graphs
- Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
- A Cheeger cut for uniform hypergraphs
- On the spectral gap of a quantum graph
- Community detection and stochastic block models: recent developments
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- A note on Fiedler value of classes with sublinear separators
- Network essence: PageRank completion and centrality-conforming Markov chains
- On the Fiedler value of large planar graphs (extended abstract)
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
- On the Fiedler value of large planar graphs
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- Cubic polyhedral Ramanujan graphs with face size no larger than six
- The geometry connectivity of hypergraphs
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- ADM-CLE approach for detecting slow variables in continuous time Markov chains and dynamic data
- The balanced connected subgraph problem for geometric intersection graphs
This page was built for publication: Spectral partitioning works: planar graphs and finite element meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869898)
