Results 1  10
of
2,134
Full graph and complete Lie algebra
, 2005
"... We introduce a concept: dcomplete, and show that a Lie algebra is dcomplete if and only if its full graph is complete. Key words and phrases dderivation, dcomplete Lie algebra, complete Lie algebra, full graph ..."
Abstract
 Add to MetaCart
We introduce a concept: dcomplete, and show that a Lie algebra is dcomplete if and only if its full graph is complete. Key words and phrases dderivation, dcomplete Lie algebra, complete Lie algebra, full graph
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 541 (48 self)
 Add to MetaCart
, requires very few parameters (like the “flammability” of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
CYCLE ROUTES OPTIMIZATION FOR NOT FULL GRAPH
"... book maintains articles on actual problems of research and application of information technologies, especially the new approaches, models, algorithms and methods fot information modeling of knowledge in: Intelligence metasynthesis and knowledge processing in intelligent systems; Formalisms and metho ..."
Abstract
 Add to MetaCart
book maintains articles on actual problems of research and application of information technologies, especially the new approaches, models, algorithms and methods fot information modeling of knowledge in: Intelligence metasynthesis and knowledge processing in intelligent systems; Formalisms and methods of knowledge representation; Connectionism and neural nets; System analysis and sintesis; Modelling of the complex artificial systems; Image Processing and Computer Vision; Computer virtual reality; Virtual laboratories for computeraided design; Decision support systems; Information models of knowledge of and for education; Open social infoeducational
Enumeration of Full Graphs: Onset of the Asymptotic Region
"... A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of n sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from a to b if the corresponding set A contains B. Kleitman ..."
Abstract
 Add to MetaCart
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of n sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from a to b if the corresponding set A contains B
ON THE ENUMERATION OF CERTAIN EQUIVALENCE CLASSES OF EULER PATHS OF FULL GRAPHS
, 1963
"... This thesis treats the problem of enumerating equivalence classes of Euler paths of full graphs. A full graph is a complete, unordered, graph with no loops or repeated edges. Two Euler paths are equivalent if and only if one can be transformed into the other by a finite sequence of rotations and ref ..."
Abstract
 Add to MetaCart
This thesis treats the problem of enumerating equivalence classes of Euler paths of full graphs. A full graph is a complete, unordered, graph with no loops or repeated edges. Two Euler paths are equivalent if and only if one can be transformed into the other by a finite sequence of rotations
Skip Graphs
 Proc. of the 14th Annual ACMSIAM Symp. on Discrete Algorithms
, 2003
"... Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems, and by providin ..."
Abstract

Cited by 306 (9 self)
 Add to MetaCart
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems
A STRONGLY REGULAR NFull GRAPH OF SMALL ORDER
"... For every n positive integer we show the construction of a strongly regular graph of order at most 2 n+2 which contains every graph of ordered n as a subgraph. The estimation concerning the construction is best possible. 1 ..."
Abstract
 Add to MetaCart
For every n positive integer we show the construction of a strongly regular graph of order at most 2 n+2 which contains every graph of ordered n as a subgraph. The estimation concerning the construction is best possible. 1
The Fast Downward planning system
 Journal of Artifical Intelligence Research
, 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other wellknown planne ..."
Abstract

Cited by 347 (29 self)
 Add to MetaCart
heuristic function, called the causal graph heuristic, which is very different from traditional HSPlike heuristics based on ignoring negative interactions of operators. In this article, we give a full account of Fast Downward’s approach to solving multivalued planning tasks. We extend our earlier
Graph evolution: Densification and shrinking diameters
 ACM TKDD
, 2007
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 267 (16 self)
 Add to MetaCart
justification, requires very few parameters (like the “flammability ” of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. We also notice that the “forest fire” model exhibits a sharp transition between sparse graphs and graphs
Escape analysis for Java
 OOPSLA
, 1999
"... This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread duriing its lifetime, so that synchronization operations on that object ca ..."
Abstract

Cited by 300 (12 self)
 Add to MetaCart
can be removed. We introduce a new program abstraction for escape analysis, the connection graph, that is used to establish reachability relationships between objects and object references. We show that the connection graph can be summarized for each method such that the same summary information may
Results 1  10
of
2,134