Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Logical matrix
Formal sciences
Mathematics
Discrete mathematics
Graph theory
Graph Chatbot
Related lectures (31)
Login to filter by course
Login to filter by course
Reset
Graphs and Networks: Basics and Applications
Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.
Finding a Base from a System of Generators
Covers the process of finding a base from a system of generators in linear algebra.
Matrix Representations: 3x3 Rank
Explores the concept of rank in 3x3 matrix representations and how it determines the structure of matrices.
Networked Control Systems: Graph Theory and Stochastic Matrices
Explores graph theory, stochastic matrices, consensus algorithms, and spectral properties in networked control systems.
Linear Equations and Vector Spaces
Delves into linear equations, vector spaces, and matrix operations, exploring solutions and representations through examples and algebraic methods.
Matrix Representations of Linear Applications
Covers matrix representations of linear applications in R³ and the invariance of rank.
Laplacian Matrix in Networked Control Systems
Explores the Laplacian matrix in electric and mechanical networks, consensus, and properties of Laplacian matrices in networked control systems.
Matrix Tree Theorem
Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.
Network Flows Meets Simplex
Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Quantization: Topological Operators
Covers the quantization of topological operators and Ising models on square lattices.
Network Flow Algorithms
Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.
Previous
Page 2 of 2
Next