9532 search results - page 110 / 1907 » Logic, Graphs, and Algorithms |
CPC
2006
14 years 11 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
ECCC
2006
14 years 11 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
TIME
2008
IEEE
15 years 5 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
FLAIRS
2008
15 years 1 months ago
2008
We present a new inference algorithm for Point-Interval Logic. The mechanism removes the incompleteness of previously reported inference mechanism for PointInterval Logic. We also...
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...