2503 search results - page 216 / 501 » A study of 3-arc graphs |
158
click to vote
IJCAI
2007
15 years 8 months ago
2007
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
176
click to vote
CN
2008
15 years 6 months ago
2008
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
143
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
221
click to vote
AMW
2009
15 years 7 months ago
2009
This paper presents an abstract data model for visualizing RDF data based on the notion of nested graphs. Our study gives theoretical results that shows directions to enhance the r...