Topological sorting of large networks
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The DT-polynomial approach to discrete time-varying network flow problems
- Minimal controllability of conjunctive Boolean networks is NP-complete
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- A batch-oblivious approach for complex job-shop scheduling problems
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Who should cast the casting vote? Using sequential voting to amalgamate information
- Stochastic enumeration with importance sampling
- Directionality of real world networks as predicted by path length in directed and undirected graphs
- 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
- On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
- Efficient computation of greyscale path openings
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations
- Improving efficiency in school choice under partial priorities
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis
- Unconditionally stable and parallel discontinuous Galerkin solver
- Bayesian network based label correlation analysis for multi-label classifier chain
- Counting and optimising maximum phylogenetic diversity sets
- Incremental evaluation of continuous preference queries
- Relational characterisations of paths
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
- The structure of 2-colored best match graphs
- Lengths of maximal green sequences for tame path algebras
- A combinatorial method to compute explicit homology cycles using discrete Morse theory
- A survey on the mathematical foundations of axiomatic entropy: representability and orderings
- TiGL: an open source computational geometry library for parametric aircraft design
- An alternative construction of internodons: the emergence of a multi-level tree of life
- Excessively duplicating patterns represent non-regular languages
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- A linear-time parameterized algorithm for computing the width of a DAG
- Enumeration of irredundant forests
- Lazy Gale-Shapley for many-to-one matching with partial information
- Path-based mathematical morphology on tensor fields
- Fast computation of greyscale path openings
- Efficient algorithms for the consensus decision problem
- Data optimizations for constraint automata
- Stochastic multicriteria acceptability analysis
- Contours and tight clusters
- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
- Scenario based robust line balancing: Computational complexity
- TSFC: A Structure-Preserving Form Compiler
- Mathematical model of biofilm-mediated pathogen persistence in a water distribution network with time-constant flows
- Ancestral Gumbel-top-k sampling for sampling without replacement
- Closing gaps in asymptotic fair division
- Efficient computation of the large inductive dimension using order- and graph-theoretic means
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
- Tight localizations of feedback sets
- Throughput scalability analysis of fork-join queueing networks
- Efficient adjustment sets for population average causal treatment effect estimation in graphical models
- Transitions States of Stochastic Chemical Kinetic Systems
- Model checking of biological systems
- A transitive closure algorithm
- A Sequential Importance Sampling Algorithm for Counting Linear Extensions
- Mirheo: high-performance mesoscale simulations for microfluidics
- 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
- 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
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Computing Connection Matrices via Persistence-Like Reductions
- Multi-period liability clearing via convex optimal control
- Freezing 1-Tag Systems with States
- A transitivity analysis of bipartite rankings in pairwise multi-class classification
- Economic genome assembly from low coverage illumina and nanopore data
- Equivalence checking for orthocomplemented bisemilattices in log-linear time
- Stochastic dynamic information flow tracking game using supervised learning for detecting advanced persistent threats
- Virtual network function reconfiguration in 5G networks: an optimization perspective
- Accessibility of support structures in topology optimization for additive manufacturing
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Fitch graph completion
- Stability based on single-agent deviations in additively separable hedonic games
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Some new results on bar visibility of digraphs
- Inductive tracing and the complexity of finding Hamiltonian path in DAGs
- Composite event recognition with arbitrary specifications
- Energy-aware flexible job shop scheduling problem with nonlinear routes and position-based learning effect
- Stratified extended multi-adjoint logic programming
- The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set
- The Ricci-flatness that lurks in weight
- Benders decomposition with delayed disaggregation for the active passive vehicle routing problem
- Labeling methods for partially ordered paths
- An \(\mathcal{O}(3.82^k)\) time \(\mathsf{FPT}\) algorithm for convex flip distance
- OPERA: a new algorithm for patient stratification based on partially ordered risk factors
- Two algorithms for shortest-paths problems in edge-weighted directed graphs
- Fast and simple sorting using partial information
- Machine learning and data analysis method for predicting an efficient algorithm for heterogeneous multicore scheduling
- Enumerating jointly reverse lectic orders for bi-adjacency matrices
- Optimal antimatroid sorting
- Partial Fitch graphs: characterization, satisfiability and complexity
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Layer-based width for \textbf{PAFP} on DAGs: a BFS-width-2 normal form and exact-length width-2 tractability
- Reducing complexes in multidimensional persistent homology theory
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- Knapsack problems in products of groups
- Applying relation algebra and RelView to solve problems on orders and lattices
This page was built for publication: Topological sorting of large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3292849)
