Sciweavers

2125 search results - page 23 / 425
» On Graph Complexity
Sort
View
DAM
2008
102views more  DAM 2008»
13 years 7 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 23 days 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 7 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
LATIN
2010
Springer
14 years 2 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
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...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...