1105 search results - page 98 / 221 » Linear choosability of graphs |
136
click to vote
DNA
2006
Springer
15 years 8 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
148
click to vote
DAM
2010
15 years 4 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
138
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
157
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
124
click to vote
ATVA
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG ...