79 search results - page 6 / 16 » Planarity of iterated line graphs |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
APPML
2007
13 years 10 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...