9532 search results - page 159 / 1907 » Logic, Graphs, and Algorithms |
106
click to vote
ECCC
2010
14 years 9 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
AICCSA
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
106
click to vote
FAW
2009
Springer
15 years 6 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 ...
JCT
2006
14 years 11 months ago
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
ICML
2006
IEEE
16 years 11 days ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...