Spectral Sequencing Based on Graph Distance

DOI10.1007/11802914_50zbMATHOpenAlexMaRDI QIDQ5757271FDO

Authors Rong Liu, Hao Zhang, Oliver van Kaick

Publication date 6 September 2007

Published in Geometric Modeling and Processing - GMP 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11802914_50

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On spectral graph drawing
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• Drawing graphs by eigenvectors: theory and practice
• Graph Drawing
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem

Cited in

(2)

• Spectral graph features for the classification of graphs and graph sequences
• Fast algorithm for sequential machine to compute pattern spectrum via city-block distance transform

This page was built for publication: Spectral Sequencing Based on Graph Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757271)