نتایج جستجو برای: complexity of algorithms

تعداد نتایج: 21191015  

Journal: :Journal of Combinatorial Optimization 2008

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

Journal: :Algorithmica 2023

Abstract A k - page upward book embedding ( UBE) of a directed acyclic graph G is embeddings on pages with the additional requirement that vertices appear in topological ordering along spine book. The UBE Testing problem, which asks whether admits UBE, was introduced 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999). In companion paper, Heath Pemmaraju 28(5), 1999) proved problem ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید