Sciweavers

109 search results - page 10 / 22
» Hamiltonian Connected Line Graphs
Sort
View
RECOMB
2004
Springer
14 years 7 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
GD
2004
Springer
14 years 24 days ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
COMPGEOM
1992
ACM
13 years 11 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
BMCBI
2004
120views more  BMCBI 2004»
13 years 7 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
CGVR
2008
13 years 8 months ago
A Graph Drawing Algorithm for the Game of Sprouts
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
Wayne Brown, Leemon C. Baird III