191 search results - page 6 / 39 » Intersections of graphs |
GD
2004
Springer
14 years 25 days ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
EJC
2008
13 years 7 months ago
2008
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
CCCG
2001
13 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...