A spectral approach to bandwidth and separator problems in graphs (Q4853927): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear labelings and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplace eigenvalues and bandwidth‐type invariants of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sum of the Largest Eigenvalues of a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank

Latest revision as of 17:02, 23 May 2024

scientific article; zbMATH DE number 812738
Language Label Description Also known as
English
A spectral approach to bandwidth and separator problems in graphs
scientific article; zbMATH DE number 812738

    Statements

    A spectral approach to bandwidth and separator problems in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 1995
    0 references
    spectral approach
    0 references
    separator problems
    0 references
    bandwidth
    0 references
    vertex separator
    0 references
    largest common subgraph
    0 references
    bounds
    0 references
    eigenvalues
    0 references
    Laplacian
    0 references
    nonlinear optimization
    0 references

    Identifiers