68 search results - page 8 / 14 » Two New Classes of Hamiltonian Graphs: (Extended Abstract) |
JGAA
2007
14 years 9 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
FORMATS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
94
Voted
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
99
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...