6598 search results - page 108 / 1320 » Graph Theory with Applications |
136
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
114
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
154
click to vote
FAW
2010
Springer
15 years 5 months ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
136
click to vote
LMCS
2006
15 years 4 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
119
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...