Lukas' Notes
Search
Search
Dark mode
Light mode
Tag: graph-theory
131 items with this tag.
3-SAT to Dominating Set (Karp Reduction)
complexity-theory
graph-theory
reductions
exponential-time-hypothesis
4-Colouring Problem
computation
graph-theory
Acyclic Graph
graph-theory
Adjacency List
graph-theory
data-structures
Adjacency Matrix
graph-theory
data-structures
Adjacency Set
graph-theory
data-structures
Adjacent Vertex
graph-theory
Arc
graph-theory
Arc Reversal
graph-theory
Bayesian Network
graph-theory
statistics
machine-learning
Bipartite Graph
graph-theory
Clique
graph-theory
Clique Decision Problem
computation
graph-theory
Closed Edge Sequence
graph-theory
Colour Refinement Algorithm
graph-theory
computation
Communicability
graph-theory
Complement Graph
graph-theory
Complete Bipartite Graph
graph-theory
Connected Graph
graph-theory
Cut
graph-theory
Cycle (Graph)
graph-theory
algorithms
Degree (Graph Theory)
graph-theory
Dense Graph
graph-theory
Dijkstra's Algorithm
graph-theory
todo
Directed Acyclic Graph
graph-theory
Directed Graph
graph-theory
Dominating Set
graph-theory
Dominating Set Problem
computation
graph-theory
Dominating Set to Integer Linear Programming (Karp Reduction)
complexity-theory
reductions
integer-programming
graph-theory
Dominating Vertex
graph-theory
Edge
graph-theory
Edge Sequence
graph-theory
todo
Edge Weight
graph-theory
Eulerian Graph
graph-theory
Eulerian Line
graph-theory
Fáry's Theorem
graph-theory
Feedback Arc Set Decision Problem
computation
graph-theory
Fibonacci Heap
data-structures
algorithms
graph-theory
Finite Directed Graph
graph-theory
Finite Graph
graph-theory
Finite Undirected Connected Graph
graph-theory
Finite Undirected Graph
graph-theory
Flow Network
graph-theory
Forest
graph-theory
Four-Color Theorem
computation
graph-theory
Girth
graph-theory
Graph
graph-theory
Graph Density
graph-theory
Graph Isomorphism
graph-theory
Graph Isomorphism Problem
graph-theory
computational-complexity
Graphic Matroid
graph-theory
computation
combinatorics
Hamiltonian Graph
graph-theory
Hamiltonian Line
graph-theory
Hamiltonian Path Problem
computation
graph-theory
Handshaking Lemma
graph-theory
Heterophilic Graph
graph-theory
Highest-Degree First Maximum Vertex Coverage Algorithm
graph-theory
approximation-algorithms
Highest-Degree First Minimum Vertex Cover Algorithm
graph-theory
computation
Homophilic Graph
graph-theory
Homophily
graph-theory
sociology
Hyperedge
graph-theory
Hypergraph
graph-theory
In-arborescence
graph-theory
Incidence Graph (Propositional Logic)
graph-theory
propositional-logic
sat-solving
Incident Edge
graph-theory
Independent Set
graph-theory
Independent Set to Chamberlin-Courant Winner Determination (Karp Reduction)
comsoc
complexity-theory
graph-theory
reductions
Independent Set to Clique (Karp Reduction)
complexity-theory
graph-theory
reductions
Independent Set to Proportional Winner Determination (Karp Reduction)
comsoc
complexity-theory
graph-theory
reductions
Independent Set to Vertex Cover (Karp Reduction)
complexity-theory
graph-theory
reductions
Induced Subgraph
graph-theory
Interval Graph
graph-theory
Isolated Vertex
graph-theory
k-degenerate Graph
graph-theory
k-regular Graph
graph-theory
Kruskal's Algorithm
graph-theory
greedy-algorithms
Leaf Node
graph-theory
Matching
graph-theory
Matching Matroid
graph-theory
Maximal Matching
graph-theory
Maximal Matching Minimum Vertex Cover Algorithm
graph-theory
computation
approximation-algorithms
Maximum Cut Optimisation Problem
graph-theory
combinatorial-optimisation
Maximum Independent Set Optimisation Problem
graph-theory
combinatorial-optimisation
Maximum Matching
graph-theory
Maximum Non-Blocker Problem
computation
graph-theory
Maximum Vertex Coverage Optimisation Problem
graph-theory
combinatorial-optimisation
Maximum-Weight Spanning Tree
computation
graph-theory
Minimal Spanning Tree
graph-theory
Minimal Spanning Tree Search Problem
graph-theory
computation
Minimum Vertex Cover
graph-theory
Minimum Vertex Cover Problem
graph-theory
computation
Minimum-Degree First Maximum Independent Set Algorithm
graph-theory
greedy-algorithms
approximation-counterexamples
Network (Graph)
graph-theory
Non-Blocker
graph-theory
Open Eulerian Line
graph-theory
Out-arborescence
graph-theory
Path
graph-theory
Planar Dominating Set Problem
computation
graph-theory
Planar Graph
graph-theory
Planar Independent Set Problem
computation
graph-theory
Planar Vertex Cover Problem
computation
graph-theory
Plane Drawing
graph-theory
Prim's Algorithm
computation
graph-theory
algorithms
Regular Graph
graph-theory
SAT to Independent Set (Karp Reduction)
complexity-theory
graph-theory
reductions
Seven Bridges of Königsberg
graph-theory
Shortest Path First
graph-theory
Shortest Path Problem
computation
graph-theory
Simple Graph
graph-theory
Simple Undirected Graph
graph-theory
Single-Vertex Flip Maximum Cut Local Search Algorithm
graph-theory
local-search
approximation-algorithms
Spanning Forest
graph-theory
Spanning Subgraph
graph-theory
Spanning Tree
graph-theory
Spectral Clustering
machine-learning
clustering
graph-theory
Star (Graph)
graph-theory
Star Sum Problem
computation
graph-theory
Strongly Connected Component (Graph)
graph-theory
Subgraph
graph-theory
Topological Sorting
graph-theory
Tree
graph-theory
Undirected Connected Graph
graph-theory
Undirected Graph
graph-theory
Vertex
graph-theory
Vertex Cover
graph-theory
Vertex Cover to Dominating Set (Karp Reduction)
complexity-theory
graph-theory
reductions
Vertex Cover to Integer Linear Programming (Karp Reduction)
complexity-theory
graph-theory
reductions
Weighted Adjacency Matrix
graph-theory
Weighted Graph
graph-theory
Weisfeiler-Leman Algorithm
graph-isomorphism
graph-theory
Weisfeiler-Leman Graph Kernel
graph-theory
kernel-methods
representation-learning
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Page 1 of 14