Sciweavers

641 search results - page 105 / 129
» On Planar Quasi-Parity Graphs
Sort
View
AAAI
2008
14 years 13 days ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
COMBINATORICA
2007
56views more  COMBINATORICA 2007»
13 years 10 months ago
On embeddability and stresses of graphs
Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness gua...
Eran Nevo
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
ICDCSW
2009
IEEE
14 years 4 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
ISSAC
2007
Springer
146views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Fast and exact geometric analysis of real algebraic plane curves
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
Arno Eigenwillig, Michael Kerber, Nicola Wolpert