scientific article; zbMATH DE number 1500676

MaRDI QIDQ4501696zbMATH OpenFDO

Authors Michael Jünger, Sebastian Leipert

Publication date 16 November 2000

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Cited in

(9)

• Level planarity: transitivity vs. even crossings
• An SPQR-tree-like embedding representation for upward planarity
• Hanani-Tutte for radial planarity. II
• Upward planarity testing in practice: SAT formulations and comparative study
• Graph Simultaneous Embedding Tool, GraphSET
• Simultaneous Embedding
• Drawing Reeb graphs
• Level planarity is more difficult than we thought (poster abstract)
• Linear layouts revisited: stacks, queues, and exact algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501696)