Sciweavers

225 search results - page 34 / 45
» From polynomial time queries to graph structure theory
Sort
View
WWW
2008
ACM
15 years 10 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
74
Voted
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
15 years 4 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 3 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
72
Voted
CCS
2007
ACM
15 years 3 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
ICSE
2008
IEEE-ACM
15 years 10 months ago
Answering conceptual queries with Ferret
Programmers seek to answer questions as they investigate the functioning of a software system, such as "which execution path is being taken in this case?" Programmers at...
Brian de Alwis, Gail C. Murphy