1105 search results - page 50 / 221 » Linear choosability of graphs |
152
click to vote
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
SIAMCOMP
2000
14 years 11 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
114
click to vote
TCBB
2011
14 years 6 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
107
click to vote
EUROGP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...