1149 search results - page 9 / 230 » Minimally non-Pfaffian graphs |
COMBINATORICS
1998
13 years 8 months ago
1998
COMBINATORICS
1998
13 years 8 months ago
1998
WG
2004
Springer
14 years 1 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
GD
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
SIAMCOMP
2000
13 years 8 months ago
2000
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...