191 search results - page 26 / 39 » Intersections of graphs |
JCT
2008
13 years 7 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
GIS
2007
ACM
13 years 11 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
EJC
2007
13 years 7 months ago
2007
3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...