An efficient algorithm to recognize locally equivalent graphs
From MaRDI portal
Publication:1181011
DOI10.1007/BF01275668zbMath0744.05052MaRDI QIDQ1181011
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01275668
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Transforming graph states using single-qubit operations, Counting single-qubit Clifford equivalent graph states is #P-complete, Prime vertex-minors of a prime graph, Recognizing locally equivalent graphs, AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES
Cites Work