National Institute of Informatics

output

20022015

most citedUniversal Quantum Computation with Continuous-Variable Cluster States

897 citations

researchers with a paper here

W. Munro2 profiles22 · h 62
Y. Yamamoto4 profiles18 · h 92
K. Nemoto15 · h 49
Keiji Matsumoto2 profiles7 · h 39
P. Loock6 · h 39
Sebastien G. R. Louis6 · h 10
T. Ladd6 · h 40
Ken‐ichi Kawarabayashi5
Masahito Hayashi5 · h 53
R. V. Meter5 · h 36
T. Spiller2 profiles5 · h 32
A. Greentree4 · h 54

collaborating institutions

Stanford UniversityUS18 papers
Hewlett-Packard (United Kingdom)GB16 papers
The University of TokyoJP14 papers
Bristol Laboratories (United Kingdom)GB13 papers
Hewlett-Packard (United States)US6 papers
Hitotsubashi UniversityJP6 papers
The University of QueenslandAU6 papers
Japan Science and Technology AgencyJP5 papers
NTT Basic Research LaboratoriesJP5 papers
The University of MelbourneAU5 papers
Centre for Quantum Computation and Communication TechnologyAU3 papers
Chinese Academy of SciencesCN3 papers

Showing math.COShow all

2 papers · 1 filter

math.CO2010★ 13 cited

The competition numbers of Hamming graphs with diameter at most three

Boram Park, Yoshio Sano

The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (…

math.CO2008

Double-critical graphs and complete minors

Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft

A connected $k$ -chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k - 2)$ -colourable. The only known double-critical $k$ -chromatic graph…