Sciweavers

469 search results - page 2 / 94
» Directed Graphs of Entanglement Two
Sort
View
AUTOMATICA
2007
81views more  AUTOMATICA 2007»
13 years 5 months ago
Feedback control of quantum entanglement in a two-spin system
— A pair of spins is the most simple quantum system that can possess entanglement, a non-classical property playing an essential role in quantum information technologies. In this...
Naoki Yamamoto, Koji Tsumura, Shinji Hara
GBRPR
2005
Springer
13 years 10 months ago
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
Bertrand Cuissart, Jean-Jacques Hébrard
FOCS
1994
IEEE
13 years 9 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
MFCS
2010
Springer
13 years 3 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich