Sciweavers

191 search results - page 21 / 39
» Intersections of graphs
Sort
View
COMBINATORICA
2011
12 years 7 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
APPML
2007
101views more  APPML 2007»
13 years 7 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
CCCG
1997
13 years 8 months ago
On the number of internal and external visibility edges of polygons
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
Jorge Urrutia
GISCIENCE
2008
Springer
117views GIS» more  GISCIENCE 2008»
13 years 8 months ago
Refining Topological Relations between Regions Considering Their Shapes
Topological relations are sometimes insufficient for differentiating spatial configurations of two objects with critical difference in their connection styles. In this paper, we pr...
Roland Billen, Yohei Kurata
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
13 years 5 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...