Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...