Quantum Algorithms for Graph Connectivity

Aleksandrs Belovs

doi:10.1007/978-1-4939-2864-4_772

Quantum Algorithms for Graph Connectivity

Aleksandrs Belovs^*

^*Corresponding author for this work

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

Original language	English
Title of host publication	Encyclopedia of Algorithms, Second Edition
Publisher	Springer New York
Pages	1671-1673
Number of pages	3
ISBN (Electronic)	9781493928644
ISBN (Print)	9781493928637
DOIs	https://doi.org/10.1007/978-1-4939-2864-4_772
Publication status	Published - 1 Jan 2016
Externally published	Yes

Keywords

Finding small subgraphs within large graphs
UPATH
USTCON

Access to Document

10.1007/978-1-4939-2864-4_772

Cite this

@inbook{4612dba9e1204449bc74389dcd2b7af2,

title = "Quantum Algorithms for Graph Connectivity",

keywords = "Finding small subgraphs within large graphs, UPATH, USTCON",

author = "Aleksandrs Belovs",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-1-4939-2864-4\_772",

language = "English",

isbn = "9781493928637",

pages = "1671--1673",

booktitle = "Encyclopedia of Algorithms, Second Edition",

publisher = "Springer New York",

address = "United States",

}

TY - CHAP

T1 - Quantum Algorithms for Graph Connectivity

AU - Belovs, Aleksandrs

PY - 2016/1/1

Y1 - 2016/1/1

KW - Finding small subgraphs within large graphs

KW - UPATH

KW - USTCON

UR - https://www.scopus.com/pages/publications/105009393450

U2 - 10.1007/978-1-4939-2864-4_772

DO - 10.1007/978-1-4939-2864-4_772

M3 - Chapter

AN - SCOPUS:105009393450

SN - 9781493928637

SP - 1671

EP - 1673

BT - Encyclopedia of Algorithms, Second Edition

PB - Springer New York

ER -

Quantum Algorithms for Graph Connectivity

Keywords

Access to Document

Other files and links

Cite this