182 search results - page 28 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
136
Voted
PODC
2010
ACM
15 years 3 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
GD
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
114
Voted
STOC
1992
ACM
15 years 3 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
172
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
138
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...