2503 search results - page 272 / 501 » A study of 3-arc graphs |
160
Voted
IJSWIS
2008
15 years 6 months ago
2008
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
153
Voted
COMBINATORICA
2007
15 years 6 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
175
Voted
SIAMDM
2008
15 years 6 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
179
Voted
TCS
2008
15 years 6 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
142
Voted
JGAA
2007
15 years 6 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...