5100 search results - page 82 / 1020 » The Linear Complexity of a Graph |
FSTTCS
1994
Springer
15 years 3 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
110
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
ISMAR
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangi...
DAM
2008
14 years 12 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
107
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...