Results 1  10
of
4,955
Hamiltonicity of automatic graphs
 Proceedings of IFIPTCS
, 2008
"... Abstract. It is shown that the existence of a (oneway) Hamiltonian path in a planar automatic graph of bounded degree is complete for Σ 1 1 , the first level of the analytical hierarchy. This sharpens a corresponding result of Hirst and Harel for highly recursive graphs. Furthermore, we also show: ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. It is shown that the existence of a (oneway) Hamiltonian path in a planar automatic graph of bounded degree is complete for Σ 1 1 , the first level of the analytical hierarchy. This sharpens a corresponding result of Hirst and Harel for highly recursive graphs. Furthermore, we also show
TRACES OF TERMAUTOMATIC GRAPHS
, 2008
"... In formal language theory, many families of languages are defined using either grammars or finite acceptors. For instance, contextsensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape’s size is proportional to that o ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
by term transducers. In particular, we show that the languages of termautomatic graphs between regular sets of vertices coincide with the languages accepted by alternating linearly bounded Turing machines. As a technical tool, we also introduce an arborescent variant of tiling systems, which provides yet
Automatic Graph Drawing Algorithms
, 1996
"... Embeddings of graphs have been of interest to theoreticians for some time, in particular those of planar graphs and graphs that are close to being planar. One definition of a planar graph is one that can be drawn in the plane with no edge crossings. While working on the fourcolour problem, Wagner(1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
or representing data. With automatically generated data sets being represented as graphs, came the need to automatically generate embeddings of graphs in a 2dimensional space, such as a computer terminal or a sheet of paper. A wide variety of fields each with their own requirements utilize automatic graph
Automatic Graph Clustering
 Graph Drawing, Lecture Notes in Computer Science
, 1996
"... We present a technique and a program for the automatic clustering of graphs. The technique is based on several heuristics, which allows for an efficient implementation on a personal computer. Our approach is capable of clustering graphs with ? 3000 vertices efficiently. The demonstration shows an i ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We present a technique and a program for the automatic clustering of graphs. The technique is based on several heuristics, which allows for an efficient implementation on a personal computer. Our approach is capable of clustering graphs with ? 3000 vertices efficiently. The demonstration shows
Automatic graph classification
"... In educational measurement, the objective is to measure some unknown latent variable or variables that represent a student’s underlying ability or abilities in a subject domain. The first step in this process is to collect observable data from the student that will provide a window into these latent ..."
Abstract
 Add to MetaCart
into these latent variables. Typically, this takes the form of a student’s response to a test question (usually called a test “item”). Multiplechoice has proven to be the most popular item format for largescale assessments because of the ease of automatically scoring student responses. However, multiple
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 698 (2 self)
 Add to MetaCart
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract

Cited by 742 (10 self)
 Add to MetaCart
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Heuristic Algorithms for Automatic Graph Partitioning
, 1995
"... Practical implementations of the Finite Element method on distributed memory multicomputer systems necessitate the use of partitioning tools to subdivide the mesh into submeshes of roughly equal size. Graph partitioning algorithms are mandatory when implementing distributed sparse matrix methods o ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
Practical implementations of the Finite Element method on distributed memory multicomputer systems necessitate the use of partitioning tools to subdivide the mesh into submeshes of roughly equal size. Graph partitioning algorithms are mandatory when implementing distributed sparse matrix methods
Unary Automatic Graphs: Algorithmic Perspective
, 2007
"... This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by finite automata over unary alphabet). We investigate algorithmic ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by finite automata over unary alphabet). We investigate algorithmic
Results 1  10
of
4,955