Sciweavers

2322 search results - page 27 / 465
» On a game in directed graphs
Sort
View
SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 8 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
GBRPR
2005
Springer
14 years 2 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
WG
2007
Springer
14 years 2 months ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
Daniel Meister, Jan Arne Telle, Martin Vatshelle

Book
1197views
15 years 6 months ago
Graph Theory with Applications
A classic book on graph theory.
J.A. Bondy and U.S.R. Murty