scientific article; zbMATH DE number 3635493

MaRDI QIDQ4195940zbMATH OpenFDO

Authors A. Goralčíková, Václav Koubek

Publication date 1979

zbMATH Keywords

AlgorithmTime ComplexityTransitive Closure of An Analytic GraphTransitive Reduction of a Graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25)

Cited in

(19)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
• An improved algorithm for transitive closure on acyclic digraphs
• Tree structure for distributive lattices and its applications
• Optimal channel allocation for several types of cellular radio networks
• Algorithms for transitive closure
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Verifying persistent security properties
• Algorithms for dense graphs and networks on the random access computer
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
• Acyclic digraphs
• On the Minimisation of Acyclic Models
• Complexité de problèmes liés aux graphes sans circuit
• An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
• Transitive closure algorithms for very large databases
• On the calculation of transitive reduction-closure of orders
• Parameterized linear time transitive closure
• Into the square: on the complexity of some quadratic-time solvable problems
• Efficient polynomial algorithms for distributive lattices

This page was built for publication:

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