Pages that link to "Directed graph"
Showing 500 items.
- Category (mathematics) (links | edit)
- Resource Description Framework (links | edit)
- Epimorphism (links | edit)
- Max-flow min-cut theorem (links | edit)
- Complete graph (links | edit)
- Regular graph (links | edit)
- Connectedness (links | edit)
- Breadth-first search (links | edit)
- Citation (links | edit)
- Phylogenetic tree (links | edit)
- Hamiltonian path problem (links | edit)
- Combinatorial species (links | edit)
- Cycle (graph theory) (links | edit)
- Scientific citation (links | edit)
- List of data structures (links | edit)
- Pattern language (links | edit)
- List of unsolved problems in mathematics (links | edit)
- State diagram (links | edit)
- Percolation theory (links | edit)
- 42 (number) (links | edit)
- First normal form (links | edit)
- Directed acyclic graph (links | edit)
- Permanent (mathematics) (links | edit)
- Concurrency control (links | edit)
- Petri net (links | edit)
- Scale-free network (links | edit)
- Reference (computer science) (links | edit)
- Hypergraph (links | edit)
- Bipartite graph (links | edit)
- Hamiltonian path (links | edit)
- Adjacency matrix (links | edit)
- Component (graph theory) (links | edit)
- Graph isomorphism (links | edit)
- Narrative (links | edit)
- Dynkin diagram (links | edit)
- Shannon switching game (links | edit)
- Intertwingularity (links | edit)
- Icosian calculus (links | edit)
- Model checking (links | edit)
- Wieferich prime (links | edit)
- Social network analysis (links | edit)
- Glossary of graph theory (links | edit)
- Graph (discrete mathematics) (links | edit)
- Graph drawing (links | edit)
- Mealy machine (links | edit)
- Sociable number (links | edit)
- Eulerian path (links | edit)
- Büchi automaton (links | edit)
- List of graph theory topics (links | edit)
- Quiver (mathematics) (links | edit)
- Gene regulatory network (links | edit)
- Cayley graph (links | edit)
- Random graph (links | edit)
- Direction (links | edit)
- Discrete geometry (links | edit)
- Dominator (graph theory) (links | edit)
- Digraph (orthography) (links | edit)
- Combinatorial optimization (links | edit)
- Incidence matrix (links | edit)
- Iterative deepening depth-first search (links | edit)
- Data engineering (links | edit)
- Pure Data (links | edit)
- Aliquot sequence (links | edit)
- 2-satisfiability (links | edit)
- Prograph (links | edit)
- Graph (abstract data type) (links | edit)
- Graph reduction (links | edit)
- Inode (links | edit)
- Pollard's rho algorithm (links | edit)
- Path analysis (statistics) (links | edit)
- Unimodular matrix (links | edit)
- Path (graph theory) (links | edit)
- Vertex (graph theory) (links | edit)
- Arc (graph theory) (redirect page) (links | edit)
- Flow network (links | edit)
- Deterministic finite automaton (links | edit)
- Greedoid (links | edit)
- Antimatroid (links | edit)
- Star height (links | edit)
- Cycle detection (links | edit)
- Line graph (links | edit)
- Schulze method (links | edit)
- Strongly connected component (links | edit)
- Edge coloring (links | edit)
- Syntactic methods (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Combinatorial proof (links | edit)
- Middle-square method (links | edit)
- Network theory (links | edit)
- Curse of dimensionality (links | edit)
- Distance matrix (links | edit)
- Dataflow (links | edit)
- Cycle graph (links | edit)
- Circulant matrix (links | edit)
- Topological sorting (links | edit)
- 185 (number) (links | edit)
- Irreducibility (mathematics) (links | edit)
- Cyclomatic complexity (links | edit)
- Distance (graph theory) (links | edit)
- Simplicial set (links | edit)
- Finite-state transducer (links | edit)
- Dataflow programming (links | edit)
- Shader (links | edit)
- Held group (links | edit)
- Instruction scheduling (links | edit)
- NL (complexity) (links | edit)
- L (complexity) (links | edit)
- Menger's theorem (links | edit)
- Exponential formula (links | edit)
- SL (complexity) (links | edit)
- Complement graph (links | edit)
- Feature selection (links | edit)
- Indegree (redirect to section "Indegree and outdegree") (links | edit)
- Regular graph (links | edit)
- Curse of dimensionality (links | edit)
- Topological sorting (links | edit)
- Degree (graph theory) (links | edit)
- Degree matrix (links | edit)
- Centrality (links | edit)
- Linear network coding (links | edit)
- New digraph reconstruction conjecture (links | edit)
- Arithmetic circuit complexity (links | edit)
- Succinct game (links | edit)
- Ear decomposition (links | edit)
- Talk:Indegree (links | edit)
- User:Morris Kurz/sandbox (links | edit)
- User:Qwerfjkl/sandbox/WD redirects (links | edit)
- Wikipedia:Missing science topics/ExistingMathI (links | edit)
- Wikipedia:Coverage of Mathworld topics/I (links | edit)
- Wikipedia:Historical archive/Unsuccessful searches (2002-07) (links | edit)
- Wikipedia:Wikipedia Signpost/2013-12-04/Recent research (links | edit)
- Wikipedia:Wikipedia Signpost/Single/2013-12-04 (links | edit)
- Least fixed point (links | edit)
- General Problem Solver (links | edit)
- Citation analysis (links | edit)
- Johnson's algorithm (links | edit)
- Binary data (links | edit)
- Rooted graph (links | edit)
- Directed edge (graph theory) (redirect page) (links | edit)
- Homophily (links | edit)
- Tournament (graph theory) (links | edit)
- Laplacian matrix (links | edit)
- Directed edge (redirect page) (links | edit)
- Geographic information system (links | edit)
- Arc (links | edit)
- Hexagon (links | edit)
- Heptadecagon (links | edit)
- Petri net (links | edit)
- Octagon (links | edit)
- Decagon (links | edit)
- Dominator (graph theory) (links | edit)
- Database transaction schedule (links | edit)
- Nonagon (links | edit)
- Icosagon (links | edit)
- Dodecagon (links | edit)
- Chiliagon (links | edit)
- Myriagon (links | edit)
- Hendecagon (links | edit)
- Tridecagon (links | edit)
- Square (links | edit)
- Graph homomorphism (links | edit)
- Triacontagon (links | edit)
- Object identifier (links | edit)
- Pentadecagon (links | edit)
- Polytree (links | edit)
- Tetradecagon (links | edit)
- Hexadecagon (links | edit)
- Vehicle routing problem (links | edit)
- Octadecagon (links | edit)
- Nearest neighbor graph (links | edit)
- Issue-based information system (links | edit)
- Megagon (links | edit)
- Pentagon (links | edit)
- Icositetragon (links | edit)
- Talk:Symmetric graph (links | edit)
- User:Tokenzero/Graph homomorphism (links | edit)
- User:Idc18 (links | edit)
- User:Wikigambit (links | edit)
- User:Y-S.Ko/Wikipedia course/Mathematics (links | edit)
- User:Tomruen/Higher polygons (links | edit)
- User:Fürwitz/sandbox (links | edit)
- Wikipedia:Suggestions for disambiguation repair/A46 (links | edit)
- Wikipedia:Reference desk/Archives/Mathematics/2014 September 15 (links | edit)
- Template:Graph Theory-footer (links | edit)
- Loop (graph theory) (links | edit)
- Degree matrix (links | edit)
- BEST theorem (links | edit)
- Small-world network (links | edit)
- Transport network analysis (links | edit)
- Clustering coefficient (links | edit)
- Centrality (links | edit)
- Circuit rank (links | edit)
- Null graph (links | edit)
- Perron–Frobenius theorem (links | edit)
- Matrix norm (links | edit)
- Connectivity (graph theory) (links | edit)
- Graph property (links | edit)
- Induced subgraph (links | edit)
- Complex network (links | edit)
- Spatial network (links | edit)
- AC-3 algorithm (links | edit)
- Multigraph (links | edit)
- Event-driven process chain (links | edit)
- Feedback vertex set (links | edit)
- Feedback arc set (links | edit)
- Graph isomorphism problem (links | edit)
- Subshift of finite type (links | edit)
- AviSynth (links | edit)
- Object–relational impedance mismatch (links | edit)
- Degree distribution (links | edit)
- Evolutionary graph theory (links | edit)
- Antiisomorphism (links | edit)
- Tree (descriptive set theory) (links | edit)
- Recursive data type (links | edit)
- Path cover (links | edit)
- De Bruijn graph (links | edit)
- Guillotine cutting (links | edit)
- Giant component (links | edit)
- Answer set programming (links | edit)
- Object graph (links | edit)
- Signed graph (links | edit)
- Out-degree (redirect to section "Indegree and outdegree"; transclusion) (links | edit)
- Reference (computer science) (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Out-degree (transclusion) (links | edit)
- Lowest common ancestor (links | edit)
- Road coloring theorem (links | edit)
- Talk:Reference (computer science) (links | edit)
- In-degree (redirect to section "Indegree and outdegree") (links | edit)
- Reference counting (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Circuit complexity (links | edit)
- Gradient network (links | edit)
- Pebble game (links | edit)
- Circuit (computer science) (links | edit)
- Talk:Smith set (links | edit)
- Wikipedia:Wikipedia Signpost/2013-04-29/Recent research (links | edit)
- Wikipedia:Wikipedia Signpost/Single/2013-04-29 (links | edit)
- Out degree (redirect to section "Indegree and outdegree"; transclusion) (links | edit)
- Out degree (transclusion) (links | edit)
- Andhra University (links | edit)
- Dual graph (links | edit)
- Weighted digraph (redirect page) (links | edit)
- Bellman–Ford algorithm (links | edit)
- Richard E. Bellman (links | edit)
- User:SummonedToDIe/sandbox (links | edit)
- Simple directed graph (redirect page) (links | edit)
- Dulmage–Mendelsohn decomposition (links | edit)
- Bidirected graph (links | edit)
- Dense graph (links | edit)
- Immerman–Szelepcsényi theorem (links | edit)
- St-connectivity (links | edit)
- Reachability (links | edit)
- Generalized geography (links | edit)
- Unique games conjecture (links | edit)
- Linear network coding (links | edit)
- Ore's theorem (links | edit)
- Causal loop diagram (links | edit)
- Bidirectional search (links | edit)
- Design structure matrix (links | edit)
- Geometric graph theory (links | edit)
- Discrete-time Markov chain (links | edit)
- BK-tree (links | edit)
- Virtual Object System (links | edit)
- Genetic representation (links | edit)
- Q-systems (links | edit)
- Confluence (abstract rewriting) (links | edit)
- Transitive reduction (links | edit)
- Edge contraction (links | edit)
- Bond graph (links | edit)
- Network on a chip (links | edit)
- Ordered graph (links | edit)
- Tatyana Ehrenfest (links | edit)
- Computational phylogenetics (links | edit)
- Book embedding (links | edit)
- Vopěnka's principle (links | edit)
- Kosaraju's algorithm (links | edit)
- Logical matrix (links | edit)
- Computer network (links | edit)
- Frank Hawthorne (links | edit)
- Andhra University College of Engineering (links | edit)
- Commitment ordering (links | edit)
- Víctor Neumann-Lara (links | edit)
- Source (graph theory) (redirect to section "Indegree and outdegree") (links | edit)
- Sink (graph theory) (redirect to section "Indegree and outdegree") (links | edit)
- Outdegree (redirect to section "Indegree and outdegree") (links | edit)
- B-tree (links | edit)
- Gnutella (links | edit)
- Tree (data structure) (links | edit)
- Control-flow graph (links | edit)
- Regular graph (links | edit)
- Branching factor (links | edit)
- Degree (graph theory) (links | edit)
- Degree matrix (links | edit)
- Centrality (links | edit)
- Out-degree (transclusion) (links | edit)
- Out degree (transclusion) (links | edit)
- Aperiodic graph (links | edit)
- Pseudoforest (links | edit)
- New digraph reconstruction conjecture (links | edit)
- Arithmetic circuit complexity (links | edit)
- Cycle rank (links | edit)
- Ear decomposition (links | edit)
- Glossary of artificial intelligence (links | edit)
- Talk:Outdegree (transclusion) (links | edit)
- User:JMP EAX/draft merge (links | edit)
- User:Qwerfjkl/sandbox/WD redirects (links | edit)
- Wikipedia:Missing science topics/ExistingMathO (links | edit)
- Wikipedia:Coverage of Mathworld topics/O (links | edit)
- Wikipedia:Templates for discussion/Log/2011 September 25 (links | edit)
- Wikipedia:Wikipedia Signpost/2013-12-04/Recent research (links | edit)
- Wikipedia:Wikipedia Signpost/Single/2013-12-04 (links | edit)
- Path coloring (links | edit)
- C4 Engine (links | edit)
- S. Rao Kosaraju (links | edit)
- Biconnected graph (links | edit)
- Take-grant protection model (links | edit)
- Dependency graph (links | edit)
- Graph arc (redirect page) (links | edit)
- NLTSS (links | edit)
- List of network scientists (links | edit)
- Grundy number (links | edit)
- Coxeter–Dynkin diagram (links | edit)
- Strahler number (links | edit)
- Paley graph (links | edit)
- Multiple edges (links | edit)
- Numbers season 2 (links | edit)
- Charlieplexing (links | edit)
- Transpose graph (links | edit)
- Pointer machine (links | edit)
- 202 (number) (links | edit)
- Representation (mathematics) (links | edit)
- Current reality tree (theory of constraints) (links | edit)
- Causal model (links | edit)
- Minimum-cost flow problem (links | edit)
- Comparability graph (links | edit)
- Aperiodic graph (links | edit)
- NTFS links (links | edit)
- Fractional cascading (links | edit)
- Parity game (links | edit)
- Retiming (links | edit)
- Rado graph (links | edit)
- Kautz graph (links | edit)
- Preferential attachment (links | edit)
- Quantum finite automaton (links | edit)
- Tarjan's strongly connected components algorithm (links | edit)
- Barabási–Albert model (links | edit)
- Community structure (links | edit)
- Watts–Strogatz model (links | edit)
- Reciprocity (network science) (links | edit)
- Assortativity (links | edit)
- Fractal dimension on networks (links | edit)
- Voltage graph (links | edit)
- Aczel's anti-foundation axiom (links | edit)
- Precedence graph (links | edit)
- Implication graph (links | edit)
- Boolean network (links | edit)
- Digraphia (links | edit)
- Handshaking lemma (links | edit)
- Nowhere-zero flow (links | edit)
- Graph enumeration (links | edit)
- Open Packaging Conventions (links | edit)
- Erdős–Rényi model (links | edit)
- Stochastic game (links | edit)
- Transition system (links | edit)
- Václav Chvátal (links | edit)
- Database model (links | edit)
- Fuzzy cognitive map (links | edit)
- Edmonds' algorithm (links | edit)
- 744 (number) (links | edit)
- Percolation threshold (links | edit)
- Oriented Graph (redirect page) (links | edit)
- Nearest neighbor graph (links | edit)
- Random geometric graph (links | edit)
- Path-based strong component algorithm (links | edit)
- Network motif (links | edit)
- Filter graph (links | edit)
- Homogeneous relation (links | edit)
- Arborescence (graph theory) (links | edit)
- Pseudoforest (links | edit)
- Hereditary property (links | edit)
- Synchronizing word (links | edit)
- Conductance (graph theory) (links | edit)
- Finite topological space (links | edit)
- Triadic closure (links | edit)
- Graph automorphism (links | edit)
- Social network aggregation (links | edit)
- Signal-flow graph (links | edit)
- Wait-for graph (links | edit)
- Auction algorithm (links | edit)
- New digraph reconstruction conjecture (links | edit)
- Kepler scientific workflow system (links | edit)
- Frequency partition of a graph (links | edit)
- Lieb's square ice constant (links | edit)
- Separoid (links | edit)
- Median graph (links | edit)
- Network science (links | edit)
- Skew-symmetric graph (links | edit)
- Coates graph (links | edit)
- Approximately finite-dimensional C*-algebra (links | edit)
- Hypohamiltonian graph (links | edit)
- Modularity (networks) (links | edit)
- DMOZ (links | edit)
- Circuit topology (electrical) (links | edit)
- Road coloring theorem (links | edit)
- Straight-line grammar (links | edit)
- Representation theory (links | edit)
- Lonely runner conjecture (links | edit)
- Directed graph (transclusion) (links | edit)
- Table of vertex-symmetric digraphs (links | edit)
- Digraph (mathematics) (redirect page) (links | edit)
- Graph isomorphism (links | edit)
- Distance (graph theory) (links | edit)
- Rooted graph (links | edit)
- Degree (graph theory) (links | edit)
- Centrality (links | edit)
- Voltage graph (links | edit)
- Series–parallel graph (links | edit)
- Signal-flow graph (links | edit)
- Flow graph (mathematics) (links | edit)
- User:AlexNewArtBot/LogicSearchResult/archive14 (links | edit)
- User:JMP EAX/draft merge (links | edit)
- Closeness centrality (links | edit)
- Aztec diamond (links | edit)
- Vertex cycle cover (links | edit)
- Closure problem (links | edit)
- Ménage problem (links | edit)
- Simul8 (links | edit)
- Bipartite double cover (links | edit)
- Young–Fibonacci lattice (links | edit)
- Graph algebra (links | edit)
- Biological network (links | edit)
- Relation (mathematics) (links | edit)
- Pebble game (links | edit)
- Directed algebraic topology (links | edit)
- Calkin–Wilf tree (links | edit)
- Matroid intersection (links | edit)
- Hamiltonian decomposition (links | edit)
- Quantum complexity theory (links | edit)
- Implicit graph (links | edit)
- Oriented matroid (links | edit)
- Graph database (links | edit)
- Split Up (expert system) (links | edit)
- Szymanski's conjecture (links | edit)
- Cycle rank (links | edit)
- Tree-depth (links | edit)
- Constraint graph (layout) (links | edit)
- Kontsevich quantization formula (links | edit)
- NetworkX (links | edit)
- Gammoid (links | edit)
- Process graph (links | edit)
- Entanglement (graph measure) (links | edit)
- Balanced digraph (redirect to section "Indegree and outdegree") (links | edit)
- Strongly-connected digraph (redirect to section "Directed graph connectivity") (links | edit)
- Path (graph theory) (links | edit)
- Subshift of finite type (links | edit)
- DGML (links | edit)
- Modular decomposition (links | edit)
- Directed cyclic graph (redirect page) (links | edit)
- Pancyclic graph (links | edit)
- Eugene Lawler (links | edit)
- DNA annotation (links | edit)
- Graph-tool (links | edit)
- Suurballe's algorithm (links | edit)
- Amitsur–Levitzki theorem (links | edit)
- Graph Style Sheets (links | edit)
- Reversible cellular automaton (links | edit)
- Euler tour technique (links | edit)
- Single-entry single-exit (links | edit)
- MALPAS Software Static Analysis Toolset (links | edit)
- Coffman–Graham algorithm (links | edit)
- Evolving network (links | edit)
- Widest path problem (links | edit)
- Katz centrality (links | edit)
- Homomorphic signatures for network coding (links | edit)
- Exponential family random graph models (links | edit)
- Kinetic scheme (links | edit)
- BF-graph (links | edit)
- Webgraph (links | edit)
- Ear decomposition (links | edit)
- Layered graph drawing (links | edit)
- Submodular set function (links | edit)
- Network theory in risk assessment (links | edit)
- Jack van Wijk (links | edit)
- Social network (links | edit)
- Polygraph (mathematics) (links | edit)
- Emanuels Grīnbergs (links | edit)
- Argumentation framework (links | edit)
- Semantic similarity network (links | edit)
- Noncommutative signal-flow graph (links | edit)
- DeGroot learning (links | edit)
- Hierarchical network model (links | edit)
- K-graph C*-algebra (links | edit)
- Malware research (links | edit)
- Unfolding (DSP implementation) (links | edit)
- Citation graph (links | edit)
- Bramble (graph theory) (links | edit)
- Orientation (graph theory) (links | edit)
- Gallai–Hasse–Roy–Vitaver theorem (links | edit)
- Robbins' theorem (links | edit)
- Free category (links | edit)
- Matroid partitioning (links | edit)
- Matroid representation (links | edit)
- Program dependence graph (links | edit)
- Social network analysis in criminology (links | edit)
- Italo Jose Dejter (links | edit)
- Pipeline Pilot (links | edit)
- Mixed graph (links | edit)
- Open energy system models (links | edit)
- JArchitect (links | edit)
- Arc diagram (links | edit)
- Interdependent networks (links | edit)
- NodeXL (links | edit)
- Real-Time Object-Oriented Modeling (links | edit)
- Bipolar orientation (links | edit)
- Upward planar drawing (links | edit)
- Pointer jumping (links | edit)
- Gale–Ryser theorem (links | edit)
- Similarity (network science) (links | edit)
- Scientific collaboration network (links | edit)
- Fulkerson–Chen–Anstee theorem (links | edit)
- Digraph realization problem (links | edit)
- Kleitman–Wang algorithms (links | edit)
- Bipartite realization problem (links | edit)
- Graph realization problem (links | edit)
- Underlying graph (redirect to section "Digraph connectivity") (links | edit)
- Tree (graph theory) (links | edit)
- Suffix automaton (links | edit)
- Hyperbolic geometric graph (links | edit)
- Degree-preserving randomization (links | edit)
- Multidimensional network (links | edit)
- Rich-club coefficient (links | edit)
- Global cascades model (links | edit)
- Individual mobility (links | edit)
- Structural cut-off (links | edit)
- Ingredient-flavor network (links | edit)
- Disparity filter algorithm of weighted network (links | edit)
- Temporal network (links | edit)
- Efficiency (network science) (links | edit)
- Quantum complex network (links | edit)
- Targeted immunization strategies (links | edit)
- Louvain method (links | edit)
- Biased random walk on a graph (links | edit)
- Information sink (redirect to section "Indegree and outdegree") (links | edit)
- Vector addition system (links | edit)
- Cppdepend (links | edit)
- Graph C*-algebra (links | edit)
- Deterministic scale-free network (links | edit)
- Node deletion (links | edit)
- Bianconi–Barabási model (links | edit)
- Network homophily (links | edit)
- Lancichinetti–Fortunato–Radicchi benchmark (links | edit)
- Rocha–Thatte cycle detection algorithm (links | edit)
- Incidence coloring (links | edit)
- Stochastic block model (links | edit)
- Logic of graphs (links | edit)
- TensorFlow (links | edit)
- Incompressibility method (links | edit)
- Graph edit distance (links | edit)
- Microsoft Cognitive Toolkit (links | edit)
- Split (graph theory) (links | edit)
- Double Cut and Join Model (links | edit)
- Glossary of artificial intelligence (links | edit)
- Bucket queue (links | edit)
- Hedonic game (links | edit)
- Mivar-based approach (links | edit)
- Certifying algorithm (links | edit)
- Weakly chained diagonally dominant matrix (links | edit)
- Envy-graph procedure (links | edit)
- Trophic coherence (links | edit)
- Pre-topological order (links | edit)
- Parsimonious reduction (links | edit)
- Cognitive social structures (links | edit)
- Relation network (links | edit)
- Configuration model (links | edit)
- Copying network models (links | edit)
- Globular set (links | edit)
- Odd cycle transversal (links | edit)
- Broadcast, unknown-unicast and multicast traffic (links | edit)
- Maximum-entropy random graph model (links | edit)
- Ilona Palásti (links | edit)
- Soft configuration model (links | edit)
- Second neighborhood problem (links | edit)
- Graph removal lemma (links | edit)
- Difference bound matrix (links | edit)
- Region (model checking) (links | edit)
- Zero-weight cycle problem (links | edit)
- Calculus on finite weighted graphs (links | edit)
- Hamiltonian cycle polynomial (links | edit)
- Lattice of stable matchings (links | edit)
- Plünnecke–Ruzsa inequality (links | edit)
- TerminusDB (links | edit)
- Directed Graph (redirect page) (links | edit)
- Random surfing model (links | edit)
- Graph homology (links | edit)
- Leavitt path algebra (links | edit)
- Activity-driven model (links | edit)
- Grid bracing (links | edit)
- Incidence and Symmetry in Design and Architecture (links | edit)
- Strong connectivity augmentation (links | edit)
- Sparsity matroid (links | edit)
- NGSI-LD (links | edit)
- Causal map (links | edit)
- Blockmodeling (links | edit)
- Flag algebra (links | edit)
- Weak component (links | edit)
- Douglas Woodall (links | edit)
- Relationship-based access control (links | edit)
- Ordinal Pareto efficiency (links | edit)
- Hortensia Galeana Sánchez (links | edit)
- Dicut (links | edit)
- Woodall's conjecture (links | edit)
- Lucchesi–Younger theorem (links | edit)
- Dijoin (links | edit)
- Submodular flow (links | edit)
- Optimal kidney exchange (links | edit)
- Math walk (links | edit)
- Leiden algorithm (links | edit)
- Hierarchical navigable small world (links | edit)