Sciweavers

1447 search results - page 85 / 290
» Graphs and Path Equilibria
Sort
View
SCN
2008
Springer
128views Communications» more  SCN 2008»
15 years 4 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
ENTCS
2002
72views more  ENTCS 2002»
15 years 3 months ago
The synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
Chloe Rispal
IPL
2010
79views more  IPL 2010»
15 years 2 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
ICSE
2003
IEEE-ACM
16 years 4 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel
139
Voted
IM
2007
15 years 4 months ago
Real Number Labelings for Paths and Cycles
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
Jerrold R. Griggs, Xiaohua Teresa Jin