Sciweavers

2463 search results - page 27 / 493
» Rankings of Directed Graphs
Sort
View
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
14 years 2 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
NIPS
2004
13 years 9 months ago
Semi-supervised Learning on Directed Graphs
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
Dengyong Zhou, Bernhard Schölkopf, Thomas Hof...
ISCAPDCS
2003
13 years 9 months ago
Heterogeneous Hardware-Software System Partitioning using Extended Directed Acyclic Graph
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
Matthew Jin, Gul N. Khan
DM
2010
98views more  DM 2010»
13 years 7 months ago
Idomatic partitions of direct products of complete graphs
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
Mario Valencia-Pabon
SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 7 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin