5889 search results - page 257 / 1178 » Graph Layout Problems |
169
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
169
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
186
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
185
click to vote
CSR
2009
Springer
15 years 7 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
156
click to vote
DM
2008
15 years 6 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...