Sciweavers

1736 search results - page 32 / 348
» On antimagic directed graphs
Sort
View
SCN
2008
Springer
128views Communications» more  SCN 2008»
14 years 11 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
ICALP
2011
Springer
14 years 3 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
WCRE
2008
IEEE
15 years 6 months ago
Graph-Centric Tools for Understanding the Evolution and Relationships of Software Structures
We present a suite of small tools, implemented as a pipeline of text file manipulating scripts, that, on one hand, measure the evolution of any software structure that can be rep...
Yijun Yu, Michel Wermelinger
ICTAI
2006
IEEE
15 years 5 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...