scientific article; zbMATH DE number 2038751

MaRDI QIDQ4449216zbMATH OpenFDO

Authors Vincent D. Blondel, Paul van Dooren

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190739.htm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• A new method of measuring similarity for a special class of directed graphs
• Iterative methods for low rank approximation of graph similarity matrices
• Toward quantifying vertex similarity in networks
• Two approaches to determining similarity of two digraphs

Cited in

(8)

• Similarity matrices for colored graphs
• Iterative methods for low rank approximation of graph similarity matrices
• Two approaches to determining similarity of two digraphs
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• Toward quantifying vertex similarity in networks
• Computational Science and Its Applications – ICCSA 2004
• A new method of measuring similarity for a special class of directed graphs
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach

This page was built for publication:

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