Sciweavers

469 search results - page 3 / 94
» Directed Graphs of Entanglement Two
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 6 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 5 months ago
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
Brett Stevens
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 5 months ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 5 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...
IPL
2007
121views more  IPL 2007»
13 years 5 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar