523 search results - page 75 / 105 » Decidability of string graphs |
122
click to vote
TAP
2008
Springer
15 years 3 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
129
click to vote
JSYML
2010
15 years 1 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
153
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
118
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
118
Voted
DLT
2006
15 years 4 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...