Mixed search number and linear-width of interval and split graphs

We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.

• Type: Journal
• Year: 2010
• Where: NETWORKS
• Authors: Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
• Keywords: Computer Networks, Interval Graphs, Mixed Search Number, NETWORKS 2010, Split Graphs