Sciweavers

4865 search results - page 126 / 973
» The Complexity of Graph Connectivity
Sort
View
INFOCOM
2012
IEEE
12 years 1 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang
FSTTCS
1994
Springer
14 years 2 months ago
On the Interactive Complexity of Graph Reliability
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...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
DAM
2008
102views more  DAM 2008»
13 years 10 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
ISMAR
2003
IEEE
14 years 3 months ago
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
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...
Daniel Belcher, Mark Billinghurst, Sean Hayes, Ran...
DAM
2008
108views more  DAM 2008»
13 years 10 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
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...
Cédric Bentz