Pages that link to "Item:Q3292849"

The following pages link to Topological sorting of large networks (Q3292849):

Displaying 50 items.

• Contours and tight clusters (Q318141) (← links)
• Scenario based robust line balancing: Computational complexity (Q442208) (← links)
• A transitivity analysis of bipartite rankings in pairwise multi-class classification (Q621565) (← links)
• Reducing complexes in multidimensional persistent homology theory (Q739614) (← links)
• Tests for differential Gaussian Bayesian networks based on quadratic inference functions (Q830113) (← links)
• Knapsack problems in products of groups (Q898247) (← links)
• Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
• The DT-polynomial approach to discrete time-varying network flow problems (Q1245139) (← links)
• Minimal controllability of conjunctive Boolean networks is NP-complete (Q1642199) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
• Inferring large graphs using \(\ell_1\)-penalized likelihood (Q1704026) (← links)
• Who should cast the casting vote? Using sequential voting to amalgamate information (Q1706791) (← links)
• Stochastic enumeration with importance sampling (Q1739341) (← links)
• Directionality of real world networks as predicted by path length in directed and undirected graphs (Q1782671) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
• On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties (Q1951607) (← links)
• Efficient computation of greyscale path openings (Q1980874) (← links)
• Towards optimal estimation of bivariate isotonic matrices with unknown permutations (Q1996765) (← links)
• Improving efficiency in school choice under partial priorities (Q2051512) (← links)
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
• Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis (Q2088347) (← links)
• Unconditionally stable and parallel discontinuous Galerkin solver (Q2122618) (← links)
• Bayesian network based label correlation analysis for multi-label classifier chain (Q2124164) (← links)
• Counting and optimising maximum phylogenetic diversity sets (Q2161386) (← links)
• Incremental evaluation of continuous preference queries (Q2195389) (← links)
• Relational characterisations of paths (Q2210868) (← links)
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs (Q2212077) (← links)
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
• The structure of 2-colored best match graphs (Q2231786) (← links)
• Lengths of maximal green sequences for tame path algebras (Q2242596) (← links)
• A combinatorial method to compute explicit homology cycles using discrete Morse theory (Q2304018) (← links)
• A survey on the mathematical foundations of axiomatic entropy: representability and orderings (Q2305843) (← links)
• TiGL: an open source computational geometry library for parametric aircraft design (Q2324399) (← links)
• An alternative construction of internodons: the emergence of a multi-level tree of life (Q2352432) (← links)
• Excessively duplicating patterns represent non-regular languages (Q2445393) (← links)
• Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
• A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
• Enumeration of irredundant forests (Q2672596) (← links)
• Lazy Gale-Shapley for many-to-one matching with partial information (Q2695460) (← links)
• Path-Based Mathematical Morphology on Tensor Fields (Q2806291) (← links)
• Fast Computation of Greyscale Path Openings (Q2946849) (← links)
• Efficient Algorithms for the Consensus Decision Problem (Q2949988) (← links)
• Data optimizations for constraint automata (Q2974782) (← links)
• Stochastic Multicriteria Acceptability Analysis (SMAA) (Q3058467) (← links)
• Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence (Q3183536) (← links)
• TSFC: A Structure-Preserving Form Compiler (Q4569311) (← links)
• Mathematical model of biofilm-mediated pathogen persistence in a water distribution network with time-constant flows (Q4625080) (← links)
• (Q4969090) (← links)