The Transitive Reduction of a Directed Graph

Cited In (only showing first 100 items - show all)

Dynamic maintenance of directed hypergraphs
How to use the minimal separators of a graph for its chordal triangulation
An algorithmic metatheorem for directed treewidth
On the complexity of strongly connected components in directed hypergraphs
New constructions for provably-secure time-bound hierarchical key assignment schemes
Finding strong bridges and strong articulation points in linear time
Cycle analysis of directed acyclic graphs
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
Max-linear models on directed acyclic graphs
Maximal and maximum transitive relation contained in a given binary relation
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
What is the dimension of citation space?
Learning large-alphabet and analog circuits with value injection queries
Foundations of semantic web databases
Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
``Global graph problems tend to be intractable
Provably-secure time-bound hierarchical key assignment schemes
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Efficient provably-secure hierarchical key assignment schemes
Generic torus orbit closures in Schubert varieties
Computing unique canonical covers for simple FDs via transitive reduction
Uniform random posets
Transitive-closure spanners: a survey
Graph-intersecting set systems and LYM inequalities
A verified algorithm enumerating event structures
On the calculation of transitive reduction-closure of orders
Acyclic digraphs
Efficient CNF simplification based on binary implication graphs
Stable allocations and partially ordered sets
LP-structures analysis: substantiation of refactoring in object-oriented programming
Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
On strongly connected digraphs with bounded cycle length
LP structures on type lattices and some refactoring problems
Variable symmetry breaking in numerical constraint problems
The complexity of Boolean matrix root computation
Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming
A model of language learning with semantics and meaning-preserving corrections
Resource allocation by means of project networks: dominance results
Complexité de problèmes liés aux graphes sans circuit
The minimum spanning strong subdigraph problem is fixed parameter tractable
Exploiting causality in gene network reconstruction based on graph embedding
Tree structure for distributive lattices and its applications
A faster tree-decomposition based algorithm for counting linear extensions
A faster tree-decomposition based algorithm for counting linear extensions
The stable \(b\)-matching polytope revisited
A linear algorithm to decompose inheritance graphs into modules
Inferring (biological) signal transduction networks via transitive reductions of directed graphs
Reduction of a nilpotent fuzzy matrix
An improved transitive closure algorithm
Transitive reduction of a rectangular Boolean matrix
Transitive reduction of a nilpotent Boolean matrix
Directed hypergraphs: introduction and fundamental algorithms -- a survey
Optimal constructions of reversible digraphs
Representation and management of MOEA populations based on graphs
Alarm placement in systems with fault propagation
Maximal independent sets in caterpillar graphs
Combinatorial representation of parameter space for switching networks
Computational experiences with some transitive closure algorithms
Counting independent sets in cocomparability graphs
An incremental algorithm for DLO quantifier elimination via constraint propagation
A compact labelling scheme for series-parallel graphs
Ergodic properties of folding maps on spheres
Minimal equivalent subgraphs containing a given set of arcs
Upside-down preference reversal: how to override ceteris-paribus preferences?
Component-graph construction
The role of structural reasoning in the genesis of graph theory
On familywise type I error control for multiplicity in equivalence trials with three or more treatments
Finding strong components using depth-first search
Approximating Transitive Reductions for Directed Networks
The secret life of keys: on the calculation of mechanical lock systems
Estimating an extreme Bayesian network via scalings
A Compact Representation for Syntactic Dependencies in QBFs
On algorithmic Coxeter spectral analysis of positive posets
Generic flux coupling analysis
Improved guarantees for vertex sparsification in planar graphs
A Sequential Importance Sampling Algorithm for Counting Linear Extensions
Toric Bruhat interval polytopes
Fault-tolerant control for a class of linear interconnected hyperbolic systems by boundary feedback
Mincut Sensitivity Data Structures for the Insertion of an Edge
Capturing complexity over space and time via deep learning: an application to real-time delay prediction in railways
Relativized adjacency
Solutions for subset sum problems with special digraph constraints
Best match graphs
Capacity-preserving subgraphs of directed flow networks
GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
An adaptive large neighbourhood search for asset protection during escaped wildfires
Approximating minimum representations of key Horn functions
Transitive closure and transitive reduction in bidirected graphs
Optimum cuts in graphs by general fuzzy connectedness with local band constraints
Computing consensus networks for collections of 1-nested phylogenetic networks
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
Morphological hierarchies: a unifying framework with new trees
Rank tests from partially ordered data using importance and MCMC sampling methods
Efficiently representing existential dependency sets for expansion-based QBF solvers
Mincut sensitivity data structures for the insertion of an edge
Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
On the relations between security notions in hierarchical key assignment schemes for dynamic structures
Multi-instance learning of pretopological spaces to model complex propagation phenomena: application to lexical taxonomy learning
Polyhedral aspects of stable marriage

This page was built for publication: The Transitive Reduction of a Directed Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659571)