191 search results - page 14 / 39 » Intersections of graphs |
GD
2009
Springer
14 years 2 days ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
STACS
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
DAM
2011
13 years 2 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
CCCG
2006
13 years 9 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....