Spectral partitioning with multiple eigenvectors
type: Item
instance of: scholarly article
title: Spectral partitioning with multiple eigenvectors
zbMATH Open document ID: 0918.68076
DOI: 10.1016/S0166-218X(98)00083-3
author: Charles J. Alpert
author: Andrew B. Kahng
author: So-Zen Yao
published in: Discrete Applied Mathematics
publication date: 1999-08-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1247543
zbMATH Keywords: graph partitioning
MaRDI profile type: Publication
cites work: Recent directions in netlist partitioning: a survey
cites work: An Algorithm for Partitioning the Nodes of a Graph
cites work: A New Heuristic for Partitioning the Nodes of a Graph
cites work: The indefinite zero-one quadratic problem
cites work: Q4127646
cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Equivalence of Memory to “Random Logic”
cites work: Lower Bounds for the Partitioning of Graphs
cites work: A computational study of graph partitioning
cites work: Q5682350
cites work: Q3499508
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q4886053
cites work: An r-Dimensional Quadratic Placement Algorithm
cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
cites work: Modeling hypergraphs by graphs with the same mincut properties
cites work: Q3997942
cites work: Q4873761
cites work: Solving the max-cut problem using eigenvalues
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: A projection technique for partitioning the nodes of a graph
Recommended article: Spectral partitioning with blends of eigenvectors
Recommended article: Q3154697
Recommended article: Multi-level spectral graph partitioning method
Recommended article: Fundamentals of Computation Theory
Recommended article: Partitioning Sparse Matrices with Eigenvectors of Graphs
Recommended article: Optimal Partitions for Eigenvalues
Recommended article: Graph partitioning by eigenvectors
Recommended article: Spectral bisection with two eigenvectors
Recommended article: Multiple partitions alignment via spectral rotation
description: scientific article; zbMATH DE number 1247543