Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

78

Voted

FCT
2005
Springer

96views Applied Computing» more FCT 2005»

Algorithms for Graphs Embeddable with Few Crossings Per Edge

15 years 8 months ago

Algorithms for Graphs Embeddable with Few Crossings Per Edge

Download www.cs.uu.nl

Alexander Grigoriev, Hans L. Bodlaender

Real-time Traffic

FCT 2005 |

claim paper

Related Content

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» Planarity Allowing Few Error Vertices in Linear Time

» Simultaneous Embedding of Planar Graphs with Few Bends

» An efficient biological pathway layout algorithm combining gridlayout and spring embedder ...

» Orthogonal Drawings with Few Layers

» Listing Triconnected Rooted Plane Graphs

» FixedLocation CircularArc Drawing of Planar Graphs

» Large haptic topographic maps marsview and the proxy graph algorithm

» Coordinate Assignment for Cyclic Level Graphs

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FCT
Authors	Alexander Grigoriev, Hans L. Bodlaender

Comments (0)