The Transitive Reduction of a Directed Graph
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The minimum spanning strong subdigraph problem is fixed parameter tractable
- Learning large-alphabet and analog circuits with value injection queries
- LP structures on type lattices and some refactoring problems
- A compact labelling scheme for series-parallel graphs
- Computational experiences with some transitive closure algorithms
- Tree structure for distributive lattices and its applications
- Alarm placement in systems with fault propagation
- What is the dimension of citation space?
- An adaptive large neighbourhood search for asset protection during escaped wildfires
- Max-linear models on directed acyclic graphs
- Counting independent sets in cocomparability graphs
- Rank tests from partially ordered data using importance and MCMC sampling methods
- The stable b-matching polytope revisited
- ``Global graph problems tend to be intractable
- An improved transitive closure algorithm
- Representation and management of MOEA populations based on graphs
- The complexity of Boolean matrix root computation
- A linear algorithm to decompose inheritance graphs into modules
- On strongly connected digraphs with bounded cycle length
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Generic torus orbit closures in Schubert varieties
- Multi-instance learning of pretopological spaces to model complex propagation phenomena: application to lexical taxonomy learning
- Biclique graphs of split graphs
- Cycle analysis of directed acyclic graphs
- Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming
- Mincut sensitivity data structures for the insertion of an edge
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints
- Solutions for subset sum problems with special digraph constraints
- Toric Bruhat interval polytopes
- Supporting dynamic updates in storage clouds with the Akl-Taylor scheme
- Component-graph construction
- Generic flux coupling analysis
- A verified algorithm enumerating event structures
- Minimum equivalent precedence relation systems
- Best match graphs
- Fault-tolerant control for a class of linear interconnected hyperbolic systems by boundary feedback
- On algorithmic Coxeter spectral analysis of positive posets
- Estimating an extreme Bayesian network via scalings
- Uniform random posets
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- An algorithmic metatheorem for directed treewidth
- Stable allocations and partially ordered sets
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- On the relations between security notions in hierarchical key assignment schemes for dynamic structures
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- On familywise type I error control for multiplicity in equivalence trials with three or more treatments
- Efficient CNF simplification based on binary implication graphs
- Resource allocation by means of project networks: dominance results
- Acyclic digraphs
- Approximating Transitive Reductions for Directed Networks
- Maximal and maximum transitive relation contained in a given binary relation
- A comparison of random task graph generation methods for scheduling problems
- A model of language learning with semantics and meaning-preserving corrections
- A Compact Representation for Syntactic Dependencies in QBFs
- Complexité de problèmes liés aux graphes sans circuit
- Provably-secure time-bound hierarchical key assignment schemes
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- Finding strong bridges and strong articulation points in linear time
- LP-structures analysis: substantiation of refactoring in object-oriented programming
- How to use the minimal separators of a graph for its chordal triangulation
- Transitive-closure spanners: a survey
- A faster tree-decomposition based algorithm for counting linear extensions
- FCA2VEC: Embedding Techniques for Formal Concept Analysis
- Scalable Visual Analytics in FCA
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- SEPARATION NUMBERS WITH RESPECT TO SQUARE NUMBERS
- Poincaré polynomials of generic torus orbit closures in Schubert varieties
- Improved guarantees for vertex sparsification in planar graphs
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- Upside-down preference reversal: how to override ceteris-paribus preferences?
- On the complexity of strongly connected components in directed hypergraphs
- The role of structural reasoning in the genesis of graph theory
- Improved guarantees for vertex sparsification in planar graphs
- Transitive closure and transitive reduction in bidirected graphs
- Polyhedral aspects of stable marriage
- Ergodic properties of folding maps on spheres
- Minimal equivalent subgraphs containing a given set of arcs
- Foundations of semantic web databases
- Combinatorial representation of parameter space for switching networks
- The secret life of keys: on the calculation of mechanical lock systems
- Reduction of a nilpotent fuzzy matrix
- Approximating minimum representations of key Horn functions
- Mincut Sensitivity Data Structures for the Insertion of an Edge
- A Sequential Importance Sampling Algorithm for Counting Linear Extensions
- Semicomplete compositions of digraphs
- Relativized adjacency
- Computing consensus networks for collections of 1-nested phylogenetic networks
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
- Morphological hierarchies: a unifying framework with new trees
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
- Capturing complexity over space and time via deep learning: an application to real-time delay prediction in railways
- Capacity-preserving subgraphs of directed flow networks
- Economic genome assembly from low coverage illumina and nanopore data
- Knowledge representation and rule mining in entity-centric knowledge bases
- A cooperative team orienteering optimisation model and a customised resolution metaheuristic
- Finding strong components using depth-first search
- Municipal street-sweeping area generation with route optimization
- Modal logics of almost-sure validities in some classes of Euclidean and transitive frames
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)
