نتایج جستجو برای: interval graphs

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

Journal: :Applicable Analysis and Discrete Mathematics 2016

Journal: :International Journal of Foundations of Computer Science 2017

Journal: :SIAM Journal on Discrete Mathematics 2015

Journal: :Discrete Mathematics, Algorithms and Applications 2010

Journal: :Journal of Graph Algorithms and Applications 2013

Journal: :Discrete Applied Mathematics 2017

Journal: :J. Graph Algorithms Appl. 2013
Peng Li Yaokun Wu

A rigid interval graph is an interval graph which has only one clique tree. In 2009, Panda and Das show that all connected unit interval graphs are rigid interval graphs. Generalizing the two classic graph search algorithms, Lexicographic Breadth-First Search (LBFS) and Maximum Cardinality Search (MCS), Corneil and Krueger propose in 2008 the so-called Maximal Neighborhood Search (MNS) and show...

2016
Pavel Klavík Yota Otachi Jirí Sejnoha

In 1969, Roberts introduced proper and unit interval graphs and proved that these classes are equal. Natural generalizations of unit interval graphs called k-length interval graphs were considered in which the number of different lengths of intervals is limited by k. Even after decades of research, no insight into their structure is known and the complexity of recognition is open even for k = 2...

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

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