TAILIEUCHUNG - Graph Drawing - Planar Directed

Upward planarity testing for ordered sets has the same complexity as for general digraphs (insert dummy vertices on transitive edges) [Kelly 87, Di Battista Tamassia 87]: upward planarity is equivalent to subgraph inclusion in a planar st-digraph (planar acyclic digraph with one source and one sink, both on the external face) | Planar Directed Graphs Graph Drawing 51 Upward Planarity Testing upward planarity testing for ordered sets has the same complexity as for general digraphs insert dummy vertices on transitive edges Kelly 87 Di Battista Tamassia 87 upward planarity is equivalent to subgraph inclusion in a planar st-digraph planar acyclic digraph with one source and one sink both on the external face Kelly 87 Di Battista Tamassia 87 upward planarity is equivalent to upward straight-line planarity Graph Drawing 52 Complexity of Upward Planarity Testing Bertolazzi Di Battista Liotta Mannino 91 O n2 -time for fixed embedding Hutton Lubiw 91 O n2 -time for single-source digraphs Bertolazzi Di Battista Mannino Tamassia 93 O n -time for single-source digraphs Garg Tamassia 93 NP-complete Graph Drawing .

Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.