Topological sorting of large networks
From MaRDI portal
Publication:3292849
DOI10.1145/368996.369025zbMath0106.32602OpenAlexW2063123613WikidataQ56443966 ScholiaQ56443966MaRDI QIDQ3292849
Publication date: 1962
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/368996.369025
Related Items (72)
Unconditionally stable and parallel discontinuous Galerkin solver ⋮ Bayesian network based label correlation analysis for multi-label classifier chain ⋮ Tests for differential Gaussian Bayesian networks based on quadratic inference functions ⋮ Model Checking of Biological Systems ⋮ Contours and tight clusters ⋮ Minimal controllability of conjunctive Boolean networks is NP-complete ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ A transitive closure algorithm ⋮ Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence ⋮ A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ Counting and optimising maximum phylogenetic diversity sets ⋮ Unnamed Item ⋮ TSFC: A Structure-Preserving Form Compiler ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Fast Computation of Greyscale Path Openings ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Enumeration of irredundant forests ⋮ Efficient Algorithms for the Consensus Decision Problem ⋮ A Sequential Importance Sampling Algorithm for Counting Linear Extensions ⋮ Mirheo: high-performance mesoscale simulations for microfluidics ⋮ Tight Localizations of Feedback Sets ⋮ Random generation of \(k\)-interactive capacities ⋮ A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Stochastic predictor-based leader-following control with input and communication delays ⋮ Improved heuristics for low-latency implementations of linear layers ⋮ A transitivity analysis of bipartite rankings in pairwise multi-class classification ⋮ Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit ⋮ On weakly and strongly popular rankings ⋮ Topological distance games ⋮ Knapsack problems in products of groups ⋮ Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Incremental evaluation of continuous preference queries ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Computing Connection Matrices via Persistence-Like Reductions ⋮ Multi-period liability clearing via convex optimal control ⋮ Freezing 1-Tag Systems with States ⋮ Inferring large graphs using \(\ell_1\)-penalized likelihood ⋮ Lazy Gale-Shapley for many-to-one matching with partial information ⋮ Who should cast the casting vote? Using sequential voting to amalgamate information ⋮ On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties ⋮ Scenario based robust line balancing: Computational complexity ⋮ Data optimizations for constraint automata ⋮ Relational characterisations of paths ⋮ Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs ⋮ Excessively duplicating patterns represent non-regular languages ⋮ Throughput Scalability Analysis of Fork-Join Queueing Networks ⋮ Mathematical model of biofilm-mediated pathogen persistence in a water distribution network with time-constant flows ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ The structure of 2-colored best match graphs ⋮ Stochastic enumeration with importance sampling ⋮ Efficient computation of greyscale path openings ⋮ Lengths of maximal green sequences for tame path algebras ⋮ Transitions States of Stochastic Chemical Kinetic Systems ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Directionality of real world networks as predicted by path length in directed and undirected graphs ⋮ Stochastic Multicriteria Acceptability Analysis (SMAA) ⋮ Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive ⋮ Rank tests from partially ordered data using importance and MCMC sampling methods ⋮ The DT-polynomial approach to discrete time-varying network flow problems ⋮ Path-Based Mathematical Morphology on Tensor Fields ⋮ Reducing complexes in multidimensional persistent homology theory ⋮ Improving efficiency in school choice under partial priorities ⋮ A combinatorial method to compute explicit homology cycles using discrete Morse theory ⋮ A survey on the mathematical foundations of axiomatic entropy: representability and orderings ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ TiGL: an open source computational geometry library for parametric aircraft design ⋮ Unnamed Item ⋮ Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis ⋮ An alternative construction of internodons: the emergence of a multi-level tree of life
This page was built for publication: Topological sorting of large networks
