Skip to Content
Handbook of Graph Drawing and Visualization
book

Handbook of Graph Drawing and Visualization

by Roberto Tamassia
August 2013
Intermediate to advanced content levelIntermediate to advanced
862 pages
32h 20m
English
Chapman and Hall/CRC
Content preview from Handbook of Graph Drawing and Visualization
68 CHAPTER 2. CROSSINGS AND PLANARIZATION
The running time for incremental planar ity testing has been improved by La Poutr´e [La 94]
to O(α(|E|, |V |)) amortized time per query and update operation. This yields an almost
linear time algorithm for the maximal planar subgraph problem that runs in O(|V | + |E| ·
α(|E|, |V |)) time. Here, α(x, y) denotes the inverse Ackermann function, which means that
α(x, y) is a function that grows extremely slowly. A linear time algorithm for finding a max-
imal planar subgraph is given by Dji dj ev [Dji95 ] . This algorithm uses BC- and S PQ R-t r ee s
and applies a fast data structure for online planarity t es ti ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Handbook of Graph Theory, 2nd Edition

Handbook of Graph Theory, 2nd Edition

Jonathan L. Gross, Jay Yellen, Ping Zhang
Drawing Product Ideas

Drawing Product Ideas

Kent E. Eisenhuth, Manuel Lima

Publisher Resources

ISBN: 9781420010268