The PC-algorithm was shown to be a powerful method for estimating the equivalence class of a potentially very high-dimensional acyclic directed graph (DAG) with the corresponding Gaussian distribution ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Graph algorithms and sparsification techniques have emerged as pivotal tools in the analysis and optimisation of complex networked systems. These approaches focus on reducing the number of edges in a ...

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.