图的二维带宽及其Laplacian特征值
도적이유대관급기Laplacian특정치
2-Dimensional Bandwidth and the Laplacian Eigenvalues of Graphs
  • 万方数据
    运筹学学报 운주학학보
    OR TRANSACTIONS
    2002年 1期 45-52 ,共8页

    肖恩利%束金龙%闻人凯

    초은리%속금룡%문인개

    二维带宽%Laplacian特征值%最优嵌入 二維帶寬%Laplacian特徵值%最優嵌入
    이유대관%Laplacian특정치%최우감입
    2-dimensional bandwidth%Laplacian eigenvalue%optimal embedding
    图的二维带宽问题是将图G嵌入平面网格图,并使基于该嵌入的函数取得最优值(通常是最小值).本文研究了图的二维带宽与其Laplacian特征值之间的关系.
    도적이유대관문제시장도G감입평면망격도,병사기우해감입적함수취득최우치(통상시최소치).본문연구료도적이유대관여기Laplacian특정치지간적관계.
    The 2-dimensional bandwidth problem may be stated as follows: Given a graph G, find an embedding of it in the grid graph, such that a certain function based on the chosen embedding will attain its optimal (usually minimum). In this paper we study the relationship between the 2-dimensional bandwidth and the Laplacian eigenvalues of a graph.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문