115 search results - page 13 / 23 » Geometric graphs with no two parallel edges |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
CVIU
2007
13 years 7 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IESS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...