Results 1  10
of
123,635
Infinitary Rewriting and Cyclic Graphs
 Electronic Notes in Theoretical Computer Science
, 1995
"... Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation techni ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation
THE PRIMITIVE BASES OF THE SIGNED CYCLIC GRAPHS
"... Abstract. The base l(S) of a signed digraph S is the maximum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. A graph can be regarded as a digraph if we consider its edges as twosided arcs. A signed cyclic graph fCn is a signed di ..."
Abstract
 Add to MetaCart
Abstract. The base l(S) of a signed digraph S is the maximum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. A graph can be regarded as a digraph if we consider its edges as twosided arcs. A signed cyclic graph fCn is a signed
HermitePade approximants for cyclic graph
, 2001
"... New construction of HermitePade approximants for the system of Markoff functions consisting in cyclic graph is presented. Integral representation and Rodrigues formula are obtained. Asymptotics of approximants is investigated. By calculation of recurrence relations the connection with Apery result ..."
Abstract
 Add to MetaCart
New construction of HermitePade approximants for the system of Markoff functions consisting in cyclic graph is presented. Integral representation and Rodrigues formula are obtained. Asymptotics of approximants is investigated. By calculation of recurrence relations the connection with Apery result
Noncyclic graph of a group
, 2007
"... We associate a graph ΓG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We associate a graph ΓG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph
CYCLIC GRAPHEDGE PRODUCT NUMBER
, 2012
"... A graph G is said to be an edge product graph if there exists an edge function f: E → P such that the function f and its corresponding edge product function F on V satisfies that F(v) P for every v V and if e1, e2, …,ep E such that f(e1). f(e2). …. f(ep) P then the edges e1, e2, …,ep are incident on ..."
Abstract
 Add to MetaCart
on a vertex. In this paper, for a given cyclic graph G(V, E), the edge product number of cycles is found.
Is it a Tree, a DAG, or a Cyclic Graph?
, 1996
"... This paper reports on the design and implementation of a practical shape analysis for C. The purpose of the analysis is to aid in the disambiguation of heapallocated data structures by estimating the shape (Tree, DAG, or Cyclic Graph) of the data structure accessible from each heapdirected pointer ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
This paper reports on the design and implementation of a practical shape analysis for C. The purpose of the analysis is to aid in the disambiguation of heapallocated data structures by estimating the shape (Tree, DAG, or Cyclic Graph) of the data structure accessible from each heap
Noncyclic graph associated with a group
, 2008
"... We associate a graph CG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup. For a simple ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We associate a graph CG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup. For a simple
CompilerDirected Reordering of Data by Cyclic Graph Coloring
"... We show that cyclic graph coloring techniques from register allocation are successfully applicable to caches. The presence of values in the cache can be modeled in analogy to register live ranges. By applying the meeting graph method, the compiler can determine an unrolling factor and guarantee ..."
Abstract
 Add to MetaCart
We show that cyclic graph coloring techniques from register allocation are successfully applicable to caches. The presence of values in the cache can be modeled in analogy to register live ranges. By applying the meeting graph method, the compiler can determine an unrolling factor and guarantee
Selectivity Estimation of Twig Queries on Cyclic Graphs
"... Abstract—Recent applications including the Semantic Web, Web ontology and XML have sparked a renewed interest on graphstructured databases. Among others, twig queries have been a popular tool for retrieving subgraphs from graphstructured databases. To optimize twig queries, selectivity estimation h ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
has been a crucial and classical step. However, the majority of existing works on selectivity estimation focuses on relational and tree data. In this paper, we investigate selectivity estimation of twig queries on possibly cyclic graph data. To facilitate selectivity estimation on cyclic graphs, we
Results 1  10
of
123,635