1199 search results - page 34 / 240 » Graph Theory |
IJCAI
2003
15 years 3 months ago
2003
Automated verification is one of the most success ful applications of automated reasoning in com puter science. In automated verification one uses algorithmic techniques to es...
161
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
72
Voted
EJC
2006
15 years 2 months ago
2006
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
115
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
129
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...