1402 search results - page 1 / 281 » Sparse-Memory Graph Search |
IJCAI
2003
13 years 6 months ago
2003
WALCOM
2010
IEEE
13 years 2 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
NETWORKS
2010
13 years 3 months ago
2010
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.
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
FAW
2009
Springer
13 years 11 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...