5100 search results - page 229 / 1020 » The Linear Complexity of a Graph |
91
Voted
ENTCS
2008
15 years 20 days ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
94
Voted
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
136
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
115
click to vote
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
111
Voted
WG
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...