1736 search results - page 74 / 348 » On antimagic directed graphs |
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
ISVC
2009
Springer
14 years 3 months ago
2009
Springer
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...
DASFAA
2007
IEEE
14 years 5 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
ICIP
2007
IEEE
14 years 5 months ago
2007
IEEE
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...