scientific article; zbMATH DE number 3635493
From MaRDI portal
Publication:4195940
zbMath0408.68038MaRDI QIDQ4195940
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)
Related Items (18)
Verifying persistent security properties ⋮ An improved algorithm for transitive closure on acyclic digraphs ⋮ Tree structure for distributive lattices and its applications ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Optimal channel allocation for several types of cellular radio networks ⋮ Algorithms for dense graphs and networks on the random access computer ⋮ Complexité de problèmes liés aux graphes sans circuit ⋮ Transitive closure algorithms for very large databases ⋮ On the Minimisation of Acyclic Models ⋮ Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays ⋮ On the calculation of transitive reduction-closure of orders ⋮ An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints ⋮ Into the square: on the complexity of some quadratic-time solvable problems ⋮ Acyclic Digraphs ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Algorithms for transitive closure ⋮ Efficient polynomial algorithms for distributive lattices ⋮ Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
This page was built for publication:
