Induced acyclic subgraphs in random digraphs: Improved bounds
نویسندگان
چکیده
Given a simple directed graph D = (V,A), let the size of the largest induced directed acyclic graph (dag) be denoted by mas(D). Let D ∈ D(n, p) be a random instance, obtained by choosing each of the ( n 2 ) possible undirected edges independently with probability 2p and then orienting each chosen edge independently in one of two possible directions with probabibility 1/2. We obtain improved bounds on the range of concentration, upper and lower bounds of mas(D). Our main result is that
منابع مشابه
On the Size of Induced Acyclic Subgraphs in Random Digraphs
Let D ∈ D(n, p) denote a simple random digraph obtained by choosing each of the ` n 2 ́ undirected edges independently with probability 2p and then orienting each chosen edge independently in one of the two directions with equal probability 1/2. Let mas(D) denote the maximum size of an induced acyclic subgraph in D. We obtain tight concentration results on the size of mas(D). Precisely, we show ...
متن کاملFinding Induced Acyclic Subgraphs in Random Digraphs
Consider the problem of finding a large induced acyclic subgraph of a given simple digraph D = (V,E). The decision version of this problem is NP -complete and its optimization is not likely to be approximable within a ratio of O(n ) for some > 0. We study this problem when D is a random instance. We show that, almost surely, any maximal solution is within an o(ln n) factor from the optimal one....
متن کاملAcyclic Colorings and Subgraphs of Directed Graphs
The acyclic chromatic number of a directed graph D, denoted χA(D), is the minimum positive integer k such that there exists a decomposition of the vertices of D into k disjoint sets, each of which induces an acyclic subgraph. We show that for all digraphs D without directed 2-cycles, we have χA(D) ≤ 4 5 · ∆̄(D) + o(∆̄(D)), where ∆̄(D) denotes the maximum arithmetic mean of the out-degree and the i...
متن کاملBounded degree acyclic decompositions of digraphs
An acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Trivially every digraph has an acyclic decomposition into two subgraphs. It is proved that for every integer sX2 every digraph has an acyclic decomposition into s subgraphs such that in each subgraph the outdegree of each vertex v is at most degðvÞ s 1 l m : For all digraphs this degree bound is optimal. r...
متن کاملAn Algorithm for Finding Connected Convex Subgraphs of an Acyclic Di- graph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. A digraph D is connected if the underlying undirected graph of D is connected. We construct an algorithm for enumeration of all connected convex subgraphs of a connected acyclic digraph D of order n. The time complexity of the algorithm is O(n · cc(D)), where cc(D) i...
متن کامل