User:Infometrix/Books/NETWORK
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
NETWORK
[edit]- CATEGORY
- NETWORK
- Network
- (C.Net.Mat)Network_(mathematics)
- Flow network
- Audit Record Generation and Utilization System
- Braess's paradox
- Circulation problem
- Dinic's algorithm
- Edmonds–Karp algorithm
- Ford–Fulkerson algorithm
- Fuzzy transportation
- Gomory–Hu tree
- Maximum flow problem
- Minimum-cost flow problem
- Multi-commodity flow problem
- Nowhere-zero flow
- Push–relabel maximum flow algorithm
- (C.Mat)Combinatorial_optimization.
- Combinatorial optimization
- Submodular set function
- 1-center problem
- A* search algorithm
- Assignment problem
- B*
- Bottleneck traveling salesman problem
- Branch and bound
- Branch and cut
- Branch and price
- Bridge and torch problem
- Change-making problem
- Combinatorial search
- Continuous knapsack problem
- Criss-cross algorithm
- Cut (graph theory)
- Cutting stock problem
- Dijkstra's algorithm
- EasyLocal
- Edge cycle cover
- Jack Edmonds
- Ellipsoid method
- Extremal combinatorics
- Floorplan (microelectronics)
- Graph bandwidth
- Greedoid
- Greedy randomized adaptive search procedure
- Harmony search
- Hungarian algorithm
- Integer programming
- Kernighan–Lin algorithm
- Knapsack problem
- Lin–Kernighan heuristic
- Linear bottleneck assignment problem
- Linear programming relaxation
- List of knapsack problems
- Matching (graph theory)
- Matroid intersection
- Max-flow min-cut theorem
- Maximum cut
- Maximum satisfiability problem
- Metric k-center
- Minimum cut
- Minimum k-cut
- Quadratic assignment problem
- Quadratic bottleneck assignment problem
- Set TSP problem
- Smallest-circle problem
- Subadditive set function
- Traveling tourist problem
- Weapon target assignment problem
- Weight function
- Category
- Graph algorithms
- Algorithmic version for Szemerédi regularity partition
- Alpha–beta pruning
- Aperiodic graph
- Barabási–Albert model
- Belief propagation
- Bellman–Ford algorithm
- Bidirectional search
- Borůvka's algorithm
- Breadth-first search
- Bron–Kerbosch algorithm
- Centrality
- Chaitin's algorithm
- Christofides algorithm
- Clique percolation method
- Closure problem
- Color-coding
- Contraction hierarchies
- Courcelle's theorem
- Cuthill–McKee algorithm
- D*
- Depth-first search
- Depth-limited search
- Dijkstra–Scholten algorithm
- Dulmage–Mendelsohn decomposition
- Edmonds' algorithm
- Blossom algorithm
- Euler tour technique
- FKT algorithm
- Flooding algorithm
- Floyd–Warshall algorithm
- Force-directed graph drawing
- Fringe search
- Girvan–Newman algorithm
- Goal node (computer science)
- Grafting (algorithm)
- Grafting (ordered tree)
- Graph embedding
- Graph isomorphism
- Graph isomorphism problem
- Graph kernel
- Graph reduction
- Graph traversal
- Hierarchical clustering of networks
- Hopcroft–Karp algorithm
- IDA*
- Iterative deepening depth-first search
- Johnson's algorithm
- Journal of Graph Algorithms and Applications
- K shortest path routing
- Karger's algorithm
- Knight's tour
- Kosaraju's algorithm
- Kruskal's algorithm
- Lexicographic breadth-first search
- Longest path problem
- Minimax
- Nearest neighbour algorithm
- Nonblocking minimal spanning switch
- Path-based strong component algorithm
- Prim's algorithm
- Proof-number search
- Reverse-delete algorithm
- Sethi–Ullman algorithm
- Shortest Path Faster Algorithm
- Shortest path problem
- SMA*
- Spectral layout
- Strongly connected component
- Subgraph isomorphism problem
- Suurballe's algorithm
- Tarjan's off-line lowest common ancestors algorithm
- Tarjan's strongly connected components algorithm
- Topological sorting
- Transitive closure
- Transitive reduction
- Travelling salesman problem
- Tree traversal
- Uniform-cost search
- Widest path problem
- Yen's algorithm
- Category
- Combinatorial algorithms
- Bees algorithm
- Bender–Knuth involution
- Bit-reversal permutation
- Cycle detection
- Fisher–Yates shuffle
- Greedy algorithm
- Jeu de taquin
- Lemke–Howson algorithm
- Loopless algorithm
- Picture (mathematics)
- Robinson–Schensted correspondence
- Robinson–Schensted–Knuth correspondence
- SMAWK algorithm
- Steinhaus–Johnson–Trotter algorithm
- Tompkins–Paige algorithm
- Category
- Computational problems in graph theory
- Canadian traveller problem
- Clique cover problem
- Clique problem
- Connected dominating set
- Correlation clustering
- Degree diameter problem
- Domatic number
- Dominating set
- Edge cover
- Edge dominating set
- Feedback arc set
- Feedback vertex set
- Graph coloring
- Graph cuts in computer vision
- Graph partition
- Graph sandwich problem
- Hamiltonian path
- Hamiltonian path problem
- Independent set (graph theory)
- Induced subgraph isomorphism problem
- Instant Insanity
- Longest uncrossed knight's path
- MaxDDBS
- Maximal independent set
- Maximum common subgraph isomorphism problem
- Multi-trials technique
- Pebble motion problems
- Planarity testing
- Route inspection problem
- Snake-in-the-box
- Spanning tree
- Steiner tree problem
- Vertex cover
- Vertex cycle cover
- Category
- Graph theory
- Glossary of graph theory
- Graph theory
- List of graph theory topics
- Aanderaa–Karp–Rosenberg conjecture
- Angular momentum diagrams (quantum mechanics)
- Baker's technique
- Betweenness centrality
- Bicircular matroid
- Biregular graph
- Cheeger constant (graph theory)
- Chemical graph theory
- Adjacent-vertex-distinguishing-total coloring
- Complex network zeta function
- Consensus dynamics
- Continuous graph
- Convex subgraph
- Copying mechanism
- Covering graph
- Cycle decomposition (graph theory)
- Cycle double cover
- Degree (graph theory)
- Degree distribution
- Dense subgraph
- Dimension (graph theory)
- Discharging method (discrete mathematics)
- Discrete Laplace operator
- Dissociation number
- Distance (graph theory)
- Dominator (graph theory)
- Edge-graceful labeling
- Erdős–Burr conjecture
- Erdős–Gyárfás conjecture
- Evolutionary graph theory
- Expander mixing lemma
- Forbidden graph characterization
- Frequency partition of a graph
- Friendship paradox
- Graph (abstract data type)
- Graph (mathematics)
- Graph algebra
- Graph canonization
- Graph dynamical system
- Graph equation
- Graph factorization
- Graph homomorphism
- Graph property
- Graph theory in enzymatic kinetics
- Handshaking lemma
- Hereditarnia
- Hereditary property
- Homeomorphism (graph theory)
- Icosian calculus
- Icosian game
- Implicit graph
- Integer-valued function
- Interval (graph theory)
- Knots and graphs
- König's lemma
- Labyrinth problem
- Lovász conjecture
- Markov chain
- Mathematical chemistry
- Maximum common edge subgraph problem
- Mixed graph
- Modular decomposition
- Multi-level technique
- Network theory
- Null model
- Power graph analysis
- Random graph
- Random walk closeness centrality
- Reconstruction conjecture
- Resistance distance
- Sequential dynamical system
- Seven Bridges of Königsberg
- Shortcut model
- Shortest-path tree
- Single-entry single-exit
- Structural induction
- Sumner's conjecture
- Szemerédi regularity lemma
- Szymanski's conjecture
- Table of the largest known graphs of a given diameter and maximal degree
- Tree of primitive Pythagorean triples
- Tripartite graphs and networks
- Ultrahomogeneous graph
- Vickrey auction
- Walls & Lines