Sciweavers

384 search results - page 74 / 77
» On s-hamiltonian-connected line graphs
Sort
View
COCOA
2009
Springer
13 years 10 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
VISSYM
2007
13 years 10 months ago
Functional Unit Maps for Data-Driven Visualization of High-Density EEG Coherence
Synchronous electrical activity in different brain regions is generally assumed to imply functional relationships between these regions. A measure for this synchrony is electroenc...
Michael ten Caat, Natasha M. Maurits, Jos B. T. M....
SGP
2007
13 years 10 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 9 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
CLA
2004
13 years 8 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig