216 search results - page 1 / 44 » Edge Search Number of Cographs in Linear Time |
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 ...
WG
2007
Springer
13 years 11 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
WG
1998
Springer
13 years 9 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
SIAMDM
2008
13 years 3 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...