Results 1  10
of
1,202,568
Generic Directed Acyclic Graphs
"... Generic algorithms are algorithms using abstract data types. Multiple generic algorithms can be linked together in a directed acyclic graph (generic DAG) so that more complex generic algorithms can be formed. Views describe relationships between dierent data types. By compilation, specialized generi ..."
Abstract
 Add to MetaCart
Generic algorithms are algorithms using abstract data types. Multiple generic algorithms can be linked together in a directed acyclic graph (generic DAG) so that more complex generic algorithms can be formed. Views describe relationships between dierent data types. By compilation, specialized
The algebra of directed acyclic graphs
 In Abramsky Festschrift, volume 7860 of LNCS
, 2013
"... ar ..."
On counting homomorphisms to directed acyclic graphs
 ICALP (1). Volume 4051 of Lecture Notes in Computer Science
, 2006
"... It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes which lie strictly between them. Thus, if P ≠ NP, it is not possible to classify NP using any finite collection of complexity classes. This situation has led to attempts to identify smaller ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
. Graph homomorphism problems are a fertile setting in which to explore dichotomy theorems. Indeed, Feder and Vardi have shown that a dichotomy theorem for the problem of deciding whether there is a homomorphism to a fixed directed acyclic graph would resolve their longstanding dichotomy conjecture
Multistate Directed Acyclic Graphs
 In Proc. Canadian AI
, 2007
"... Abstract. This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states and ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states
ALGEBRAS ASSOCIATED TO DIRECTED ACYCLIC GRAPHS
, 707
"... Abstract. We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices and edges. Each finite directed acyclic graph admits a structure of a generalized layered graph. We construct linear bases in such algebras an ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices and edges. Each finite directed acyclic graph admits a structure of a generalized layered graph. We construct linear bases in such algebras
LCA queries in directed acyclic graphs
 In Proceedings of the 32nd ICALP, Lecture Notes in Computer Science 3580
, 2005
"... Abstract. We present two methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is surprisingly natural and solves the allpairs LCA problem for the input dag on n vertices and m edges in time O(nm). ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Abstract. We present two methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is surprisingly natural and solves the allpairs LCA problem for the input dag on n vertices and m edges in time O
DAGMA: MINING DIRECTED ACYCLIC GRAPHS
"... We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi or singlerooted, and induced fragments. With a new canonical form that is based on the nodes ' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi or singlerooted, and induced fragments. With a new canonical form that is based on the nodes ' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan
Steiner Problems on Directed Acyclic Graphs
 LECTURE NOTES IN COMPUTER SCIENCE 1090: PROCEEDINGS OF THE 2ND INTERNATIONAL SYMPOSIUM ON COMPUTING AND COMBINATORICS
, 1996
"... In this paper, we consider two variations of the minimumcost Steiner problem on a directed acyclic graph G(V; E) with a nonnegative weight on each edge of E. The minimum directed Steiner network problem is defined as follows. Given a set of starting vertices S ae V and a set of terminating vertic ..."
Abstract
 Add to MetaCart
In this paper, we consider two variations of the minimumcost Steiner problem on a directed acyclic graph G(V; E) with a nonnegative weight on each edge of E. The minimum directed Steiner network problem is defined as follows. Given a set of starting vertices S ae V and a set of terminating
SIMILARITY OF WEIGHTED DIRECTED ACYCLIC GRAPHS
, 2006
"... To my dear grandparents, parents and wife. ii This thesis proposes a weighted DAG (wDAG) similarity algorithm for matchmaking in eBusiness environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this informati ..."
Abstract
 Add to MetaCart
this information. In order to make the interaction between agents more meaningful and finegrained, we choose nodelabeled, arclabeled and arcweighted directed acyclic graphs to represent their products/services. This wDAG representation is more expressive and efficient than the earlier weighted tree
Covering Pairs in Directed Acyclic Graphs
"... Abstract. The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexi ..."
Abstract
 Add to MetaCart
Abstract. The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the compu
Results 1  10
of
1,202,568