Sciweavers

1274 search results - page 49 / 255
» Graph lambda theories
Sort
View
CSL
2009
Springer
14 years 3 months ago
Automatic Structures of Bounded Degree Revisited
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...
Dietrich Kuske, Markus Lohrey
CP
2008
Springer
13 years 10 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
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 ...
Stanislav Zivný, Peter Jeavons
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 1 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
GD
2006
Springer
14 years 15 days ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
INFOCOM
2012
IEEE
11 years 11 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang