نتایج جستجو برای: graphoidal cover

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

Journal: :International Journal of Pure and Apllied Mathematics 2014

متن کامل
Journal: :AKCE International Journal of Graphs and Combinatorics 2015

متن کامل
Journal: :Australasian J. Combinatorics 2007
S. Arumugam I. Sahul Hamid

متن کامل
Journal: :AKCE International Journal of Graphs and Combinatorics 2018

متن کامل
Journal: :Discrete Mathematics 1998

متن کامل
Journal: :AKCE International Journal of Graphs and Combinatorics 2020

متن کامل
Journal: :Discrete Mathematics 2001

متن کامل
Journal: :AKCE International Journal of Graphs and Combinatorics 2020

متن کامل
Journal: :Theor. Comput. Sci. 1993
R. Srikant Ravi Sundaram Karan Sher Singh C. Pandu Rangan

The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. Finding an optimal path cover for an arbitrary graph is known to be NP-complete [3]. However, polynornial-time algorithms exist for trees [4], cacti [4] and for interval graphs [9]. The solution presented in [2] For circular-arc graphs is known to be wrong. In ...

متن کامل
Journal: Geopersia 2011
- -

Geopersia is published biannually by the College of Science, University of Tehran, Iran. The College of Science published Journal of Science, which covered all fields of basic science, from 1968 to 2010. It was then decided that the College’s journals should be more specialized, and hence publication of Geopersia was launched. Articles printed in Geopersia will be available online too. Aims an...

متن کامل

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

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