1883 search results - page 162 / 377 » Ordered theta graphs |
176
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
196
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
157
click to vote
EJC
2008
15 years 5 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
178
click to vote
ICDCSW
2005
IEEE
15 years 11 months ago
2005
IEEE
Today’s multimedia environments are characterized by different stationary and a growing number of mobile devices, like PDAs or even mobile phones. To meet their requirements reg...
157
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...