selecting an effective project plan is a significant area in the project management. the present paper introduces a technique to identify the project plan efficient frontier for assessing the alternative project plans and selecting the best plan. the efficient frontier includes two criteria: the project cost and the project time. besides, the paper presents a scheme to incorporate directed acyc...

Inthispaper,ahierarchicalensembleclassificationapproachthatutilizesaDirectedAcyclicGraph (DAG)structureisproposedasasolutiontothemulti-classclassificationproblem.TwomainDAG structuresareconsidered:(i)rootedDAG,and(ii)non-rootedDAG.Themainchallengesthatare consideredinthispaperare:(i)thesuccessivemisclassificationissueassociatedwithhierarch...

We consider a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. This graph is of interest as an st-dag with a minimum possible number of mincuts.We present a linear-time algorithm for recognizing nested graphs.

This paper analyzes a blockchain network forming directed acyclic graph (DAG), called DAG-type blockchain, from the viewpoint of algorithm theory. To use NP-hard optimization problems on DAG are required to be solved. Although various for undirected and graphs can efficiently solved by using notions parameters, these currently known parameters meaningless DAGs, which implies that it is hopeless...

Treewidth of an undirected graph measures how close the graph is to being a tree. Several problems that are NP-hard on general graphs are solvable in polynomial time on graphs with bounded treewidth. Motivated by the success of treewidth, several directed analogues of treewidth have been introduced to measure the similarity of a directed graph to a directed acyclic graph (DAG). Directed treewid...

We begin with trying to find the shortest path in a directed acyclic graph (DAG). Recall that a DAG has directed edges and contains no cycles. Recall the definition of a topological sort: Definition 1. Let G = (V,E) be a graph. Let v1, . . . ,vn be an ordering of the vertices in V . v1, . . . ,vn are in topologically sorted order if for all edges (vi,v j) ∈ E, i < j. If G is a DAG, then it is a...

Graphical models are widely used to encode conditional independence constraints and causal assumptions, the directed acyclic graph (DAG) being one of the most common types of models. However, DAGs are not closed under marginalization: that is, a chosen marginal of a distribution Markov to a DAG might not be representable with another DAG, unless one discards some of the structural independencie...

In order to find a causal explanation for data presented in the form of covariance and con­ centration matrices it is necessary to decide if the graph formed by such associations is a projection of a directed acyclic graph ( dag). We show that the general problem of deciding whether such a dag exists is NP-complete.

Constructing Directed Acyclic Graph (DAG) on a graph is one of the fundamental problems of graph theory. We propose a self-stabilizing protocol for DAG construction on mobile ad-hoc network (MANET) and show that it can construct a DAG which has better property than known one. Furthermore, we evaluate our protocol by applying it to geocast protocol on MANET. Our computer simulation results show ...

There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on DAG-networks. We briefly discuss the relation of DAG-games with other networkbased cost games. We demonstrate tha...