77 search results - page 6 / 16 » Large cycles in 4-connected graphs |
SCAM
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
SMI
2010
IEEE
13 years 5 months ago
2010
IEEE
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
COMBINATORICS
2002
13 years 7 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
SI3D
2003
ACM
14 years 18 days ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...