3267 search results - page 171 / 654 » Generalized quasirandom graphs |
176
click to vote
AAIM
2005
Springer
16 years 3 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
175
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
210
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
132
click to vote
SWAT
1990
Springer
15 years 10 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
173
click to vote
COMPGEOM
2007
ACM
15 years 10 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 ...