F Contact us


0

Video of the week

Post-edited

The partially disjoint paths problem

Schrijver, Alexander (Author of the conference)

Loading the player...

planar graph sources and terminals disjoint paths polynomial-time algorithm VLSI directed graphs free group partially disjoint paths graph group fixed parameter tractable

Latest Videos

Chaire Jean-Morlet - First Semester 2017: 'KPZ Universality and Directed Polymers'

Konstantin "Kostya" Mikhailovich Khanin is a Russian mathematician and physicist. Khanin received his PhD from the ...
Recently, an important research activity on mean field games (MFGs for short) has been initiated by the pioneering works of Lasry and Lions: it aims at studying the asymptotic behavior of stochastic ...
I shall classify current approaches to multiple inferences according to goals, and discuss the basic approaches being used. I shall then highlight a few challenges that await our attention : some are ...
Martin Hairer KBE FRS (born 14 November 1975 in Geneva, Switzerland) is an Austrian mathematician working in the field of stochastic analysis, in particular stochastic partial differential equations. ...
Robinsonian matrices are structured matrices that have been introduced in the 1950's by the archeologist W.S. Robinson for chronological dating of Egyptian graves. A symmetric matrix is said to be ...
The problem of testing if a graph can be colored with a given number $k$ of colors is $NP$-complete for every $k>2$. But what if we have more information about the input graph, namely that some fixed ...
Random hyperbolic graphs (RHG) were proposed rather recently (2010) as a model of real-world networks. Informally speaking, they are like random geometric graphs where the underlying metric space has ...
We present new results concerning restricted types of matchings such as uniquely restricted matchings and acyclic matchings, and we also consider the corresponding edge coloring notions. Our focus ...
Z