1199 search results - page 39 / 240 » Graph Theory |
119
Voted
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
106
click to vote
CPM
2001
Springer
15 years 7 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
130
click to vote
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
105
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
130
click to vote
TAGT
1998
Springer
15 years 6 months ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...