2322 search results - page 143 / 465 » On a game in directed graphs |
140
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
175
click to vote
RP
2010
Springer
15 years 4 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
158
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
167
click to vote
SEMWEB
2004
Springer
15 years 11 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...