Quantum Spectral Clustering of Mixed Graphs

Spectral graph partitioning is a well known technique to estimate clusters in undirected graphs. Recent approaches explored efficient spectral algorithms for directed and mixed graphs utilizing various matrix representations. Despite its success in clustering tasks, classical spectral algorithms suf...

Full description

Bibliographic Details

Published in:	2021 58th ACM/IEEE Design Automation Conference (DAC) pp. 463 - 468
Main Authors:	Volya, Daniel, Mishra, Prabhat
Format:	Conference Proceeding
Language:	English
Published:	IEEE 05.12.2021
Subjects:	Clustering algorithms Computers eigenvalue computation eigenvector projection Machine learning Machine learning algorithms Partitioning algorithms Quantum computing Runtime spectral graph clustering
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!