2503 search results - page 17 / 501 » A study of 3-arc graphs |
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
WWW
2005
ACM
14 years 10 months ago
2005
ACM
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
PVLDB
2008
13 years 9 months ago
2008
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
DAM
1998
13 years 9 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...