Concept

K-vertex-connected graph

Related lectures (29)

Lee-Yang Theory

Explores the Lee-Yang theory, covering connected graphs, paths, phase diagrams, and analytic continuation.

Topology of Riemann Surfaces

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

Graph Theory Basics

Introduces induced flows, basis matrices, and tree solutions in graph theory.

Networks: Trees MOOC: Optimization: principles and algorithms - Network and discrete optimization

Explains the concept of trees in graph theory and the definition of a spanning tree.

Coxeter groups: classification and crystallographic construction

Covers the classification of Coxeter groups, crystallographic construction, and Coxeter elements.

Algebraic Graph Theory: Matrices and Connectivity

Explores algebraic graph theory applied to networked control systems and consensus algorithms.

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Networked Control Systems: Properties of Laplacian Matrices

Explores Laplacian matrix properties in networked control systems and their relation to graph theory.

Minimal Spanning Tree

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Laplacian Matrix: Properties and Examples

Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Neuronal Connectivity Patterns

Explores neuronal connectivity patterns, connection probabilities, and experimental techniques used to study synaptic connectivity.

Centrality and Hubs

Delves into centrality and hubs in network neuroscience, exploring node importance, small-world networks, brain structural connectome, and percolation theory.

Network Formation: Random Connection Models

Explores network formation through random connection models and node degree distribution.

Fundamentals of Brain Connectomics

Introduces the basics of brain connectomics, including terminology, data preprocessing, functional MRI, connectivity measures, and modular structure.

Brain Connectomics: Basics of Neuroimaging

Covers the basics of brain connectomics, including brain networks, terminology, data schemes, preprocessing, node connectivity, and functional connectome structure.

Gateways to the Moon and Local Floer Homology

Explores the problem of a falling stone hitting the moon, focusing on gateways to the moon and local Floer homology.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Complex Systems: Critical Phenomena

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.