Jump to content

User:Artisticidea/Books/Graph Theory

From Wikipedia, the free encyclopedia

< User:Artisticidea

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:

MediaWiki2LaTeX provides a softcopy PDF service. Uniquely, it remains under active support and may be used online or installed locally.
Pedia Press offer final tidying and ordering of print-on-demand bound copies in (approximately) A5 format.

For help with downloading a single Wikipedia page as a PDF, see Help:Download as PDF.

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 ]

Graph Theory[edit]

2-factor theorem

2-plan project management software

A* search algorithm

Aanderaa–Karp–Rosenberg conjecture

Abstract syntax tree

Acyclic coloring

Adjacency algebra

Adjacency matrix

Adjacent-vertex-distinguishing-total coloring

Albertson conjecture

Algebraic connectivity

Algebraic graph theory

Algebraic modeling language

Algorithmic version for Szemerédi regularity partition

Alpha centrality

Alpha–beta pruning

Angular resolution (graph drawing)

Ant colony optimization algorithms

Aperiodic graph

Apollonian network

Approximation algorithm

Area (graph drawing)

Art gallery problem

Assignment problem

Associative array

Audit Record Generation and Utilization System

Axon Idea Processor

Baker's technique

Bandwidth allocation

Barabási–Albert model

Barnette's conjecture

Baum–Welch algorithm

Bayesian network

Belief propagation

Bellman–Ford algorithm

Bend minimization

Best-first search

Betweenness centrality

Bicircular matroid

Biconnected component

Bidirectional search

Binary search tree

Binary space partitioning

Biological classification

Bipartite graph

Bipartite matroid

Bipartite realization problem

Biregular graph

Blossom algorithm

Book (graph theory)

Boolean algebra

Boolean function

Boolean satisfiability problem

Borůvka's algorithm

Bottleneck traveling salesman problem

Braess's paradox

Branch and bound

Breadth-first search

Bridge Protocol Data Unit

Bron–Kerbosch algorithm

Brooks' theorem

Brute-force search

Butterfly graph

Buzan's iMindMap

Cage (graph theory)

Canadian traveller problem

Candidate solution

Capacitated minimum spanning tree

Category (mathematics)

Caterpillar tree

Cayley's formula

Chaitin's algorithm

Cheeger constant (graph theory)

Christofides algorithm

Chromatic polynomial

Circle packing theorem

Circular coloring

Circular layout

Circulation problem

Clique (graph theory)

Clique cover problem

Clique percolation method

Closure problem

Clustering coefficient

Coffman–Graham algorithm

Combinatorial optimization

Compendium (software)

Complement graph

Complete bipartite graph

Complete coloring

Completely Fair Scheduler

Complex network zeta function

Computational complexity theory

ConceptDraw MINDMAP

Conceptual graph

Concorde TSP Solver

Conductance (graph)

Conference graph

Conference matrix

Connected component (graph theory)

Connected dominating set

Connectivity (graph theory)

Consensus dynamics

Constraint logic programming

Constraint programming

Constraint satisfaction

Constraint satisfaction problem

Continuous graph

Contraction hierarchies

Convex subgraph

Copying mechanism

Correlation clustering

Courcelle's theorem

Critical path method

Crossing number (graph theory)

Curse of dimensionality

Cuthill–McKee algorithm

Cutting stock problem

Cycle (graph theory)

Cycle decomposition (graph theory)

Cycle double cover

De Bruijn graph

De Bruijn sequence

Defective coloring

Degree (graph theory)

Degree diameter problem

Degree distribution

Degree-constrained spanning tree

Depth-first search

Depth-limited search

Deterministic algorithm

Digraph realization problem

Dijkstra's algorithm

Dijkstra–Scholten algorithm

Dimension (graph theory)

Dinic's algorithm

Directed acyclic graph

Discharging method (discrete mathematics)

Discrete Laplace operator

Discrete optimization

Distance (graph theory)

Distance-regular graph

Distance-transitive graph

Distributed algorithm

Distributed minimum spanning tree

Dominance drawing

Dominator (graph theory)

Dorothea Wagner

DOT (graph description language)

Double pushout graph rewriting

Dual polyhedron

Duality (mathematics)

Dulmage–Mendelsohn decomposition

Dynamic programming

Edge contraction

Edge dominating set

Edge-transitive graph

Edmonds' algorithm

Edmonds–Karp algorithm

Edward Reingold

Entanglement (graph measure)

Entitative graph

Equitable coloring

Erdős–Burr conjecture

Erdős–Gyárfás conjecture

Erdős–Hajnal conjecture

Euclidean minimum spanning tree

Euler tour technique

Evolutionary computation

Existential graph

Expander mixing lemma

Expected linear time MST algorithm

Exponential tree

Extractor (mathematics)

Extremal graph theory

Failure analysis

Failure mode and effects analysis

Fault tree analysis

Feedback arc set

Feedback vertex set

Five room puzzle

Flooding algorithm

Floyd–Warshall algorithm

Forbidden graph characterization

Force-directed graph drawing

Ford–Fulkerson algorithm

Four color theorem

Fractional coloring

Frequency partition of a graph

Frequent subtree mining

Friendship graph

Friendship paradox

Frucht's theorem

Functional programming

Fuzzy transportation

Fáry's theorem

Genetic algorithm

Genetic operator

Genetic programming

Genus (mathematics)

Geometric lattice

Giant component

Girth (graph theory)

Girvan–Newman algorithm

Glossary of graph theory

Goal node (computer science)

Goldner–Harary graph

Gomory–Hu tree

Graceful labeling

Graph (abstract data type)

Graph (mathematics)

Graph amalgamation

Graph automorphism

Graph bandwidth

Graph canonization

Graph coloring game

Graph cuts in computer vision

Graph dynamical system

Graph embedding

Graph factorization

Graph homomorphism

Graph isomorphism

Graph isomorphism problem

Graph partition

Graph reduction

Graph sandwich problem

Graph traversal

Graph-structured stack

Graphic matroid

Graphical model

Greedy algorithm

Greedy coloring

Greedy randomized adaptive search procedure

Grinberg's theorem

Grötzsch graph

Grötzsch's theorem

Guided Local Search

Hadwiger–Nelson problem

Hajós construction

Half-transitive graph

Hamiltonian path

Hamiltonian path problem

Hanani–Tutte theorem

Handshaking lemma

Harmonious coloring

Havel–Hakimi algorithm

Heap (data structure)

Hereditary property

Heuristic (computer science)

Hidden Markov model

Hierarchical clustering of networks

Homeomorphism (graph theory)

Hopcroft–Karp algorithm

Hyperbolic tree

Hypercube graph

Icosian calculus

Ihara zeta function

In-place algorithm

Incidence matrix

Inclusion–exclusion principle

Independent set (graph theory)

Induced subgraph isomorphism problem

Inner product space

Inspiration Software

Instant Insanity

Integer programming

International Symposium on Graph Drawing

Ishikawa diagram

Iterated logarithm

Iterative deepening depth-first search

Johnson's algorithm

Journal of Graph Algorithms and Applications

Jump point search

Junction tree algorithm

K shortest path routing

K-minimum spanning tree

K-Variegated graph

K-vertex-connected graph

Karger's algorithm

Kinetic minimum spanning tree

Kirchhoff's theorem

Kleitman–Wang algorithms

Knapsack problem

Knowledge representation and reasoning

Kosaraju's algorithm

Kruskal's algorithm

Kuratowski's theorem

Labyrinth (software)

Laplacian matrix

Layered graph drawing

Left-leaning red–black tree

Left-right planarity test

Level structure

Lexicographic breadth-first search

Linear programming

Lin–Kernighan heuristic

List edge-coloring

List of algorithms

List of concept- and mind-mapping software

List of data structures

List of graph theory topics

List of order structures in mathematics

Local consistency

Longest path problem

Longest uncrossed knight's path

Loop (graph theory)

Lovász conjecture

Mac Lane's planarity criterion

Machine learning

Markov random field

Matching (graph theory)

Matching polynomial

Mathematical logic

Mathematical optimization

Mathematics of Sudoku

Matroid intersection

Matroid representation

Max-flow min-cut theorem

Maximal independent set

Maximum common edge subgraph problem

Maximum common subgraph isomorphism problem

Maximum flow problem

Maze generation algorithm

Memetic algorithm

Meta-optimization

Metric k-center

Meurs Challenger

Michael T. Goodrich

Microsoft Automatic Graph Layout

Mind Map Architect

Mindjet (software)

Minimum degree spanning tree

Minimum rank of a graph

Minimum spanning tree

Minimum spanning tree-based segmentation

Minimum-cost flow problem

Modularity (networks)

Multi-commodity flow problem

Multi-level technique

Multi-trials technique

Multipartite graph

Nearest neighbour algorithm

Neighbor joining

Neighbourhood (graph theory)

Nested triangles graph

No free lunch in search and optimization

Nonblocking minimal spanning switch

Nowhere-zero flow

NP (complexity)

Nurse scheduling problem

Open Shortest Path First

Operations research

Optimization problem

Optimizing compiler

Orientation (graph theory)

Oriented coloring

Out-of-kilter algorithm

Outerplanar graph

P versus NP problem

Pancyclic graph

Parry–Sullivan invariant

Partial permutation

Particle swarm optimization

Partition matroid

Partition of a set

Path (graph theory)

Path analysis (computing)

Path analysis (statistics)

Path-based strong component algorithm

Pattern matching

Pebble motion problems

Peripheral cycle

Permutation matrix

Persistent data structure

Phylogenetic tree

Pierre Rosenstiehl

Pigeonhole principle

Planar separator theorem

Planar straight-line graph

Planarity testing

Polyhedral graph

Polynomial-time approximation scheme

Prim's algorithm

Probabilistic risk assessment

Processor register

Proof-number search

Push–relabel maximum flow algorithm

Quiver (mathematics)

Ramanujan graph

Ramsey's theorem

Random minimal spanning tree

Random walk closeness centrality

Rank (graph theory)

Reconstruction conjecture

Rectilinear minimum spanning tree

Recurrence relation

Red–black tree

Register allocation

Reliability block diagram

Resistance distance

Reverse-delete algorithm

Rigi (software)

Rigidity matroid

Roberto Tamassia

Robertson–Seymour theorem

Root cause analysis

Route inspection problem

RP (complexity)

Scale-free network

Scheinerman's conjecture

Schnyder's theorem

Science of Science Tool (Sci2)

Search algorithm

Seidel adjacency matrix

Self-balancing binary search tree

Semantik (software)

Semi-symmetric graph

Semidefinite programming

Sequential dynamical system

Series-parallel graph

Set (abstract data type)

Set TSP problem

Sethi–Ullman algorithm

Seven Bridges of Königsberg

Sharp-P-complete

Shortest Path Faster Algorithm

Shortest path problem

Shortest total path length spanning tree

Shortest-path tree

Simulated annealing

Single-entry single-exit

Snake-in-the-box

Snark (graph theory)

Solina Mind Mapping Software

Spanning Tree Protocol

Sparse graph code

Spatial network

Spectral clustering

Spectral graph theory

Spectral layout

Sperner's lemma

Star (graph theory)

Steiner tree problem

Steinitz's theorem

Strangulated graph

Stress majorization

Strong coloring

Strong orientation

Strongly connected component

Strongly regular graph

Structural induction

Subgraph isomorphism problem

Subhamiltonian graph

Sumner's conjecture

Suurballe's algorithm

Swarm intelligence

Symmetric graph

Symmetry breaking

Szymanski's conjecture

Tait's conjecture

Tarjan's off-line lowest common ancestors algorithm

Tarjan's strongly connected components algorithm

Technology tree

Ternary search tree

Thickness (graph theory)

Threshold graph

Time complexity

Topological sorting

Tournament (graph theory)

Transitive closure

Transitive reduction

Transpose graph

Traveling purchaser problem

Traveling tournament problem

Travelling salesman problem

Tree (data structure)

Tree (descriptive set theory)

Tree (graph theory)

Tree (set theory)

Tree decomposition

Trellis (graph)

Triangle-free graph

Tulip (software)

Tutte embedding

Tutte polynomial

Ultrahomogeneous graph

Uniform matroid

Uniform spanning tree

Uniform-cost search

Uniquely colorable graph

Unit disk graph

Universal point set

Upward planar drawing

Van Emde Boas tree

Variable neighborhood search

Vehicle rescheduling problem

Vehicle routing problem

Verbal arithmetic

Vertex (graph theory)

Vertex cycle cover

Vertex-transitive graph

Virtual Link Trunking

Visibility graph

Visone (software)

Viterbi algorithm

Wagner's theorem

Water, gas, and electricity

Weapon target assignment problem

Whitney's planarity criterion

Why–because analysis

Widest path problem

Yen's algorithm

Gallery of named graphs

Table of simple cubic graphs

Table of the largest known graphs of a given diameter and maximal degree

Incidence structure

Incidence (geometry)

Isogonal figure

Causal loop diagram

Cause–effect graph

Accident analysis

Causal structure

Counterfactual conditional

Cartesian product

Tensor product of graphs

Cartesian product of graphs

Lexicographic product of graphs

Strong product of graphs

Modular product of graphs

Rooted product of graphs

Kronecker product

Zig-zag product

Min-plus matrix multiplication

Vizing's conjecture

Hedetniemi's conjecture

Dependency graph

Constraint graph (layout)

Brinkmann graph

Hoffman–Singleton graph

Shrikhande graph

Asymmetric graph

Biconnected graph

Circulant graph

Claw-free graph

Comparability graph

Convex bipartite graph

Distance-hereditary graph

Even-hole-free graph

Factor-critical graph

Hypohamiltonian graph

Implication graph

K-edge-connected graph

Convex polytope

Quasi-bipartite graph

Self-complementary graph

Skew-symmetric graph

Small-world network

Strongly chordal graph

Trivially perfect graph

Universal graph

Well-covered graph

Graph operations

Bipartite double cover

Periodic graph (graph theory)

Intersection graph

Circular-arc graph

Indifference graph

Intersection number (graph theory)

Permutation graph

Polygon-circle graph

Trapezoid graph

Möbius–Kantor graph

Harries–Wong graph

Biggs–Smith graph

Blanuša snarks

Brouwer–Haemers graph

Block (data storage)

Tree accumulation

Pebble automaton

Polychotomous key

Retrieved from "https://en.wikipedia.org/w/index.php?title=User:Artisticidea/Books/Graph_Theory&oldid=888204058"

User namespace book pages