3471 search results - page 54 / 695 » Obstacle Numbers of Graphs |
CIE
2007
Springer
14 years 3 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
FLAIRS
1998
13 years 10 months ago
1998
The increasing number of knowledge-based systems that build on a Bayesian belief network or influence diagram acknowledge the usefulness of these frameworks for addressing complex...
EUROGP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
DM
2000
13 years 9 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
DM
1998
13 years 8 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...